Optimal bounds for the approximation of boolean functions and some applications

Author： Andreev A.E. Clementi A.E.F. Rolim J.D.P.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.180, Iss.1, 1997-06, pp. : 243-268

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation of boolean functions by combinatorial rectangles

By Sauerhoff M.

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 45-78

Elsevier

Access to resources Recommend Favorite

Review of Cryptographic Boolean Functions and Applications by Thomas Cusick and Pantelimon Stănică

By Joyner David

Cryptologia, Vol. 37, Iss. 2, 2013-04 ,pp. : 189-192

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exploiting Functional Properties of Boolean Functions for Optimal Multi-Level Design by Bi-Decomposition

By Steinbach Bernd

Artificial Intelligence Review, Vol. 20, Iss. 3-4, 2003-12 ,pp. : 319-360

Springer Publishing Company

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

Horn functions and submodular Boolean functions

By Ekin O. Hammer P.L. Peled U.N.

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 257-270

Elsevier

Access to resources Recommend Favorite