Consequences of the provability of NP ⊆ P/poly

Publisher： Cambridge University Press

E-ISSN： 1943-5886|72|4|1353-1371

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.72, Iss.4, 2007-12, pp. : 1353-1371

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

Donaldson–Thomas theory of n×P1

By  

Compositio Mathematica, Vol. 145, Iss. 5, 2009-09 ,pp. : 1249-1276

Cambridge University Press

Access to resources Recommend Favorite

A model-theoretic proof for P ≠ NP over all infinite abelian group

By  

The Journal of Symbolic Logic, Vol. 67, Iss. 1, 2002-03 ,pp. : 235-238

Cambridge University Press

Access to resources Recommend Favorite

P versus NP and computability theoretic constructions in complexity theory over algebraic structures

By  

The Journal of Symbolic Logic, Vol. 69, Iss. 1, 2004-03 ,pp. : 39-64

Cambridge University Press

Access to resources Recommend Favorite

Provability in predicate product logic

By Laskowski Michael  

Archive for Mathematical Logic, Vol. 46, Iss. 5-6, 2007-07 ,pp. : 365-378

Springer Publishing Company

Access to resources Recommend Favorite

Sentences implying their own provability

By  

The Journal of Symbolic Logic, Vol. 48, Iss. 3, 1983-09 ,pp. : 777-789

Cambridge University Press

Access to resources Recommend Favorite