Article thumbnail
Location of Repository

Ultimate Polynomial Time

By Gregorio Malajovich

Abstract

The class UP of ‘ultimate polynomial time ’ problems over C is introduced; it contains the class P of polynomial time problems over C. The τ-Conjecture for polynomials implies that UP does not contain the class of non-deterministic polynomial time problems definable without constants over C. This latest statement implies that P ̸ = N P over C. A notion of ‘ultimate complexity ’ of a problem is suggested. It provides lower bounds for the complexity of structured problems.

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.236.8161
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/math/9904... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.