Towards Bounding Complexity of a Minimal Model

ISSN： 0010-437X

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

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

Bounding the Trellis State Complexity of Algebraic Geometric Codes

By Munuera Carlos Torres Fernando

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 2, 2004-09 ,pp. : 81-100

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

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

The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas

By Kleine Büning Hans

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

Springer Publishing Company

Access to resources Recommend Favorite

A bounding surface plasticity model for unsaturated soil at small strains

INTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS, Vol. 39, Iss. 11, 2015-08 ,pp. : 1141-1164

John Wiley & Sons Inc

Access to resources Recommend Favorite