The complexity of minimal satisfiability problems

Author： Kirousis L.M.   Kolaitis P.G.  

Publisher： Elsevier

ISSN： 0890-5401

Source： Information and Computation, Vol.187, Iss.1, 2003-11, pp. : 20-39

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

Complexity of Generalized Satisfiability Counting Problems

By Creignou N.   Hermann M.  

Information and Computation, Vol. 125, Iss. 1, 1996-02 ,pp. : 1-12

Academic Press

Access to resources Recommend Favorite

Towards Bounding Complexity of a Minimal Model

By Tsai I-Hsun  

Compositio Mathematica, Vol. 138, Iss. 3, 2003-09 ,pp. : 245-260

Springer Publishing Company

Access to resources Recommend Favorite

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights

By van Maaren H.  

Annals of Mathematics and Artificial Intelligence, Vol. 37, Iss. 3, 2003-03 ,pp. : 273-283

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of Ring Morphism Problems

By Kayal Neeraj  

computational complexity, Vol. 15, Iss. 4, 2006-12 ,pp. : 342-390

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

By Büning Hans  

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

Springer Publishing Company

Access to resources Recommend Favorite