The Complexity of Read-Once Resolution

Author： Kleine Büning H.  

Publisher： Springer Publishing Company

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.36, Iss.4, 2002-12, pp. : 419-435

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

Completeness and Non-Completeness Results with Respect to Read-Once Projections

By Bollig B.   Wegener I.  

Information and Computation, Vol. 143, Iss. 1, 1998-05 ,pp. : 24-33

Academic Press

Access to resources Recommend Favorite

Learning read once functions using subcube parity queries

By Voronenko A.  

Computational Mathematics and Modeling, Vol. 22, Iss. 1, 2011-01 ,pp. : 81-91

Springer Publishing Company

Access to resources Recommend Favorite

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

By Kullmann Oliver  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 303-352

Springer Publishing Company

Access to resources Recommend Favorite

Zeta(2) Once Again

By Krause Ralph M.  

American Mathematical Monthly, Vol. 121, Iss. 4, 2014-04 ,pp. : 353-354

Mathematical Association of America

Access to resources Recommend Favorite

All Triangles at Once

By Gaspar Jaime  

American Mathematical Monthly, Vol. 122, Iss. 10, 2015-12 ,pp. : 982-982

Mathematical Association of America

Access to resources Recommend Favorite