Ultimate Polynomial Time

Details Ultimate Polynomial Time Ultimate Polynomial Time

1999-04-22

arxiv.org/abs/math/9904130v1

Mathematics

Numerical Analysis

Scientific paper

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that $\mathcal{UP}$ does not contain the class of non-deterministic polynomial time problems definable without constants over $\mathbb C$. This latest statement implies that $\mathcal P \ne \mathcal{NP}$ over $\mathbb C$. A notion of `ultimate complexity' of a problem is suggested. It provides lower bounds for the complexity of structured problems.

Affiliated with

Also associated with

No associations

Rating

Ultimate Polynomial Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ultimate Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ultimate Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626953