Approximation of Boolean Functions by Local Search

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.1, 2004-01, pp. : 53-82

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

The complexity of Boolean constraint satisfaction local search problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Boolean Constraint Satisfaction Local Search Problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite

On the independence of Boolean functions

By Chuan-Kun Wu

International Journal of Computer Mathematics, Vol. 82, Iss. 4, 2005-04 ,pp. : 415-420

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mobius transforms, coincident Boolean functions and non-coincidence property of Boolean functions

By Pieprzyk Josef

International Journal of Computer Mathematics, Vol. 88, Iss. 7, 2011-05 ,pp. : 1398-1416

Taylor & Francis Ltd

Access to resources Recommend Favorite

On cross-correlation properties of Boolean functions

By Ze-peng Zhuo

International Journal of Computer Mathematics, Vol. 88, Iss. 10, 2011-07 ,pp. : 2035-2041

Taylor & Francis Ltd

Access to resources Recommend Favorite