Sequential computation of linear Boolean mappings

We prove that any linear Boolean mapping of dimension n can be computed with a double sequence of linear assignments of the n variables. The proof is effective and gives a decomposition of Boolean matrices and directed graphs.

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2004-02, Vol.314 (1), p.287-292
Main Authors: Burckel, Serge, Morillon, Marianne
Format: Article
Language:English
Subjects:
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Boolean functions
Computer science
control theory
systems
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Linear algebra
Linear and multilinear algebra, matrix theory
Mathematics
Matrices
Sciences and techniques of general use
Theoretical computing
Theoretical study. Circuits analysis and design
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that any linear Boolean mapping of dimension n can be computed with a double sequence of linear assignments of the n variables. The proof is effective and gives a decomposition of Boolean matrices and directed graphs.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2003.11.027