Lower bounds are not easier over the reals: Inside PH

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 832-843

  Fournier, Hervé ^a   Koiran, Pascal ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

LOWER BOUNDS; NP PROBLEMS; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME;

AUTOMATA THEORY;

EID: 84983126637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_70     Document Type: Conference Paper

References (14)

1. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.
2. F. Cucker and P. Koiran. Computing over the reals with addition and order: Higher complexity classes. Journal of Complexity, 11:358-376, 1995.
3. H. Fournier and P. Koiran. Are lower bounds easier over the reals ? In Proc. 30th ACM Symposium on Theory of Computing, pages 507-513, 1998.
4. H. Fournier and P. Koiran. Lower bounds are not easier over the reals: Inside PH. LIP Research Report 99-21, Ecole Normale Supérieure de Lyon, 1999.
5. P. Koiran. Computing over the reals with addition and order. Theoretical Computer Science, 133(1):35-48, 1994.
6. K. Meer. A note on a P6=NP result for a restricted class of real machines. Journal of Complexity, 8:451-453, 1992.
7. F. Meyer auf der Heide. A polynomial linear search algorithm for the n-dimensional knapsack problem. Journal of the ACM, 31(3):668-676, 1984.
8. F. Meyer auf der Heide. Fast algorithms for n-dimensional restrictions of hard problems. Journal of the ACM, 35(3):740-747, 1988.
9. B. Poizat. Les Petits Cailloux. Nur Al-Mantiq Wal-Ma’rifah 3. Aléas, Lyon, 1995.
10. A. Schrijver. Theory of Linear and Integer Programming. Wiley, New-York, 1986.
11. M. Shub and S. Smale. On the intractability of Hilbert's Nullstellensatz and an algebraic version of “P=NP”. Duke Mathematical Journal, 81(1):47-54, 1996.
12. S. Smale. On the P=NP problem over the complex numbers. Lecture given at the MSRI workshop on Complexity of Continuous and Algebraic Mathematics, November 1998. Lecture on video at www.msri.org.
13. L. G. Valiant. Completeness classes in algebra. In Proc. 11th ACM Symposium on Theory of Computing, pages 249-261, 1979.
14. L. G. Valiant. Reducibility by algebraic projections. In Logic and Algorithmic (an International Symposium held in honour of Ernst Specker), pages 365-380. Monographie no 30 de L'Enseignement Mathématique, 1982.