Generalizations of Matched CNF Formulas

Author： Szeider Stefan  

Publisher： Springer Publishing Company

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.43, Iss.1-4, 2005-01, pp. : 223-238

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

Generalizations of matched CNF formulas

By Szeider Stefan  

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

Springer Publishing Company

Access to resources Recommend Favorite

Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points

By Goldberg Eugene  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 65-89

Springer Publishing Company

Access to resources Recommend Favorite

Testing satisfiability of CNF formulas by computing a stable set of points

By Goldberg Eugene  

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

Springer Publishing Company

Access to resources Recommend Favorite

On certain generalizations of the Hopf bifurcation

By Aguirre L.   Arredondo J.   López R.   Seibert P.  

Annali di Matematica Pura ed Applicata, Vol. 186, Iss. 3, 2007-07 ,pp. : 509-524

Springer Publishing Company

Access to resources Recommend Favorite

E -convexity and its generalizations

By Soleimani-damaneh M.  

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3335-3349

Taylor & Francis Ltd

Access to resources Recommend Favorite