Identification of Disjoint Bi-decompositions in Boolean Functions through Walsh Spectrum

By Falkowski Bogdan J.  

VLSI Design, Vol. 14, Iss. 3, 2002-01 ,pp. : 307-313

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

By Sakurai A.  

Theoretical Computer Science, Vol. 137, Iss. 1, 1995-01 ,pp. : 109-127

Elsevier

Access to resources Recommend Favorite

On the computability of Walsh functions

By Mori T.  

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 419-436

Elsevier

Access to resources Recommend Favorite

Multiplicative Properties of Spectral Walsh Coefficients of the Boolean Function

By Yanushkevich C. N.  

Automation and Remote Control, Vol. 64, Iss. 12, 2003-12 ,pp. : 1938-1947

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Tree-shellability of Boolean functions

By Takenaga Y.   Nakajima K.   Yajima S.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 633-647

Elsevier

Access to resources Recommend Favorite