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

Publisher： Cambridge University Press

E-ISSN： 1943-5886|69|1|39-64

ISSN： 0022-4812

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

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

Computability-Theoretic Complexity of Countable Structures

By  

Bulletin of Symbolic Logic, Vol. 8, Iss. 4, 2002-12 ,pp. : 457-477

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

COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY

By  

The Journal of Symbolic Logic, Vol. 79, Iss. 3, 2014-08 ,pp. : 859-881

Cambridge University Press

Access to resources Recommend Favorite

The computability of group constructions II

By  

Bulletin of the Australian Mathematical Society, Vol. 8, Iss. 1, 1973-02 ,pp. : 27-60

Cambridge University Press

Access to resources Recommend Favorite

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