Lower Bounds Are Not Easier over the Reals: Inside PH
We prove that all NP problems over the reals with addition and order can be solved in polynomial time with the help of a boolean NP oracle. As a consequence, the “P = NP?” question over the reals with addition and order is equivalent to the classical question. For the reals with addition and equality only, the situation is quite different since P is known to be different from NP. Nevertheless, we prove similar transfer theorems for the polynomial hierarchy.
KeywordsPolynomial Time Turing Machine Polynomial Size Polynomial Hierarchy Transfer Theorem
Unable to display preview. Download preview PDF.
- 1.L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 9.B. Poizat. Les Petits Cailloux. Nur Al-Mantiq Wal-Ma’rifah 3. Aléas, Lyon, 1995.Google Scholar
- 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 http://www.msri.org.
- 13.L. G. Valiant. Completeness classes in algebra. In Proc. 11th ACM Symposium on Theory of Computing, pages 249–261, 1979.Google Scholar
- 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 n o 30 de L’Enseignement Mathématique, 1982.Google Scholar