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

Author： Gault Richard L.  

Publisher： Springer Publishing Company

ISSN： 1432-4350

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

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

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

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

By  

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

Cambridge University Press

Access to resources Recommend Favorite

A class of time discrete schemes for a phase–field system of Penrose–Fife type

By Klein Olaf  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 33, Iss. 6, 2010-03 ,pp. : 1261-1292

Edp Sciences

Access to resources Recommend Favorite

An infinite class of identities

By  

Bulletin of the Australian Mathematical Society, Vol. 75, Iss. 2, 2007-04 ,pp. : 239-246

Cambridge University Press

Access to resources Recommend Favorite