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

Author： van Maaren H.  

Publisher： Springer Publishing Company

ISSN： 1012-2443

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

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

Least-Squares Approximations in Geometric Buildup for Solving Distance Geometry Problems

By Luo Xin-long   Wu Zhi-jun  

Journal of Optimization Theory and Applications, Vol. 149, Iss. 3, 2011-06 ,pp. : 580-598

Springer Publishing Company

Access to resources Recommend Favorite

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

Numerical method for solving a class of nonlinear elliptic inverse problems

By Essaouini M.   Nachaoui A.   El Hajji S.  

Journal of Computational and Applied Mathematics, Vol. 162, Iss. 1, 2004-01 ,pp. : 165-181

Elsevier

Access to resources Recommend Favorite

On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators

By Chen Gaojie  

Mathematical Methods of Operations Research, Vol. 67, Iss. 3, 2008-06 ,pp. : 455-469

Springer Publishing Company

Access to resources Recommend Favorite

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