Every polynomial-time 1-degree collapses if and only if P = PSPACE

Publisher： Cambridge University Press

E-ISSN： 1943-5886|69|3|713-741

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.69, Iss.3, 2004-09, pp. : 713-741

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

A minimal degree which collapses ω1

By  

The Journal of Symbolic Logic, Vol. 49, Iss. 1, 1984-03 ,pp. : 298-300

Cambridge University Press

Access to resources Recommend Favorite

An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes

By Gault Richard L.  

Theory of Computing Systems, Vol. 39, Iss. 5, 2006-09 ,pp. : 753-783

Springer Publishing Company

Access to resources Recommend Favorite

Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring

By Coron Jean-Sebastien  

Journal of Cryptology, Vol. 20, Iss. 1, 2007-01 ,pp. : 39-50

Springer Publishing Company

Access to resources Recommend Favorite

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

By Katz Jonathan  

Journal of Cryptology, Vol. 21, Iss. 3, 2008-07 ,pp. : 303-349

Springer Publishing Company

Access to resources Recommend Favorite

Sets which do not have subsets of every higher degree1

By  

The Journal of Symbolic Logic, Vol. 43, Iss. 1, 1978-03 ,pp. : 135-138

Cambridge University Press

Access to resources Recommend Favorite