Sequential computation of linear Boolean mappings

被引：4
|
作者：
Burckel, S [1 ]
Morillon, M [1 ]
机构：
[1] Univ Reunion, Lab ERMIT, BP 7151, F-97715 St Denis Messageries, Reunion, France
来源：
THEORETICAL COMPUTER SCIENCE | 2004年 / 314卷 / 1-2期
关键词：
linear algebra; Boolean functions; matrices;
D O I：
10.1016/j.tcs.2003.11.027
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：287 / 292
页数：6
相关论文
共 50 条
12345