Boolean layer cakes. Proceedings ORDAL '96

Author： Schmid J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.217, Iss.2, 1999-04, pp. : 255-278

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 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

Complete and incomplete Boolean degrees

By Marchenkov S.  

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

MAIK Nauka/Interperiodica

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

Negative Boolean constraints

By Marriott K.   Odersky M.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 365-380

Elsevier

Access to resources Recommend Favorite