Complete and incomplete Boolean degrees

Author： Marchenkov S.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.46, Iss.4, 2010-12, pp. : 346-352

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

On the topological size of p-m-complete degrees

By Zimand M.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 137-147

Elsevier

Access to resources Recommend Favorite

Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems: Hybrid Optimization Techniques (Editors: Narendra Jussien and François Laburthe)

By Prestwich Steven  

Annals of Operations Research, Vol. 130, Iss. 1-4, 2004-08 ,pp. : 57-73

Springer Publishing Company

Access to resources Recommend Favorite

On boolean lowness and boolean highness

By Reith S.   Wagner K.W.  

Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. : 305-321

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

Dependency in Cooperative Boolean Games

By Sauro Luigi   Villata Serena  

Journal of Logic and Computation, Vol. 23, Iss. 2, 2013-04 ,pp. : 425-444

Oxford University Press

Access to resources Recommend Favorite