Propositional lower bounds: Algorithms and complexity

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.27, Iss.1-4, 1999-01, pp. : 129-148

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

Lower bounds for algebraic complexity of nilpotent associative algebras

By Leont’ev A.

Journal of Mathematical Sciences, Vol. 169, Iss. 5, 2010-09 ,pp. : 644-650

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

By Bshouty N.H.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 1-20

Academic Press

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

Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions

By Bernasconi A. Egidi L.

Information and Computation, Vol. 153, Iss. 1, 1999-08 ,pp. : 1-25

Academic Press

Access to resources Recommend Favorite

On the complexity of entailment in propositional multivalued logics

By Cadoli M. Schaerf M.

Annals of Mathematics and Artificial Intelligence, Vol. 18, Iss. 1, 1997-01 ,pp. : 29-50

Springer Publishing Company

Access to resources Recommend Favorite