Almost k-wise independence and hard Boolean functions

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.297, Iss.1, 2003-03, pp. : 281-295

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

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

Boolean Functions as Models for Quantified Boolean Formulas

By Kleine Büning Hans Subramani K. Zhao Xishun

Journal of Automated Reasoning, Vol. 39, Iss. 1, 2007-07 ,pp. : 49-75

Springer Publishing Company

Access to resources Recommend Favorite

Decision tree approximations of Boolean functions

By Mehta

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 609-623

Elsevier

Access to resources Recommend Favorite

Decision lists and related Boolean functions

By Eiter T. Ibaraki T. Makino K.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 493-524

Elsevier

Access to resources Recommend Favorite