Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Polynomial time uniformization and non-standard methods

Polynomial time uniformization and non-standard methods This paper presents the contents of a talk given in December 1990, during the second “Journées sur les Arithmétiques Faibles” held at the LITP, Paris; the talk was repeated during the 1991 Ecole de Printemps of Méjannes le Clap. The paper proves a polynomial time computability result for a class of NP inter co-NP problems, for which only the obvious exponential time algorithm was known. The result is proved by a striking use of non-standard methods, and it is not clear at all how to obtain it by standard methods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Polynomial time uniformization and non-standard methods

Loading next page...
 
/lp/springer-journals/polynomial-time-uniformization-and-non-standard-methods-TAvrPNkkog

References (7)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/BF02127795
Publisher site
See Article on Publisher Site

Abstract

This paper presents the contents of a talk given in December 1990, during the second “Journées sur les Arithmétiques Faibles” held at the LITP, Paris; the talk was repeated during the 1991 Ecole de Printemps of Méjannes le Clap. The paper proves a polynomial time computability result for a class of NP inter co-NP problems, for which only the obvious exponential time algorithm was known. The result is proved by a striking use of non-standard methods, and it is not clear at all how to obtain it by standard methods.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Aug 13, 2005

There are no references for this article.