Complexity of Boolean Functions Satisfying the Propagation Criterion
スポンサーリンク
概要
- 論文の詳細を見る
Complexity of Boolean functions satisfying the propagation criterion (PC), an extended notion of the perfect nonlinearity, is discussed on several computation models. The following topics are investigated: (i) relationships between the unateness and the degree of the PC, (ii) the inversion complexity of perfectly nonlinear Boolean functions, (iii) the formula size of Boolean functions that satisfy the PC of degree 1, (iv) the area-time-square complexity of VLSI circuits computing perfectly nonlinear Boolean functions, (v) the OBDD size of perfectly nonlinear Boolean functions.
- 社団法人電子情報通信学会の論文
- 1995-04-25
著者
-
Ikeda Katsuo
Faculty Of Engineering Kyoto University
-
Hirose Shouichi
Faculty of Engineering, Kyoto University
-
Hirose Shouichi
Faculty Of Engineering Kyoto University
関連論文
- Propagation Characteristics of Boolean Functions and Their Balancedness
- Relationships among Nonlinearity Criteria of Boolean Functions
- Complexity of Boolean Functions Satisfying the Propagation Criterion
- Extraction of inclined Character Strings from Unformed Document Images Using the Confidence Value of a Character Recognizer
- Fast String Searching in a Character Lattice (Special Issue on Document Analysis and Recognition)