Complexity of Generalized Satisfiability Counting Problems

ISSN： 0890-5401

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

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

The complexity of minimal satisfiability problems

By Kirousis L.M. Kolaitis P.G.

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

Elsevier

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

Generalized Equilibrium Problems and Generalized Complementarity Problems

By Park S.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 2, 1997-11 ,pp. : 409-417

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

DESCRIPTIONAL COMPLEXITY OF GENERALIZED FORBIDDING GRAMMARS

By MEDUNA ALEXANDER ŠVEC MARTIN

International Journal of Computer Mathematics, Vol. 80, Iss. 1, 2002-01 ,pp. : 11-17

Taylor & Francis Ltd

Access to resources Recommend Favorite