Abstract
We study the question whether there are analogues of Ladner’s result in the computational model of Blum, Shub and Smale. It is known that in the complex and the additive BSS model a pure analogue holds, i.e. there are non-complete problems in NP ∖ P assuming NP ≠ P. In the (full) real number model only a non-uniform version is known. We define a new variant which seems relatively close to the full real number model. In this variant inputs can be treated as in the full model whereas real machine constants can be used in a restricted way only. Our main result shows that in this restricted model Ladner’s result holds. Our techniques analyze a class P/const that has been known previously to be crucial for this kind of results. By topological arguments relying on the polyhedral structure of certain sets of machine constants we show that this class coincides with the new restricted version of \({\rm P}_{\mathbb R},\) thus implying Ladner’s result.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ben-David, S., Meer, K., Michaux, C.: A note on non-complete problems in \({\rm NP}\sb {\bf R}\). J. Complexity 16(1), 324–332 (2000)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, New York (1998)
Bürgisser, P.: On the structure of Valiant’s complexity classes. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 194–204. Springer, Heidelberg (1998)
Chapuis, O., Koiran, P.: Saturation and stability in the theory of computation over the reals. Ann. Pure Appl. Logic 99(1-3), 1–49 (1999)
Cucker, F., Shub, M., Smale, S.: Separation of complexity classes in Koiran’s weak model. Theoret. Comput. Sci. 133(1), 3–14 (1994); Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993)
Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005)
Ladner, R.E.: On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22, 155–171 (1975)
Malajovich, G., Meer, K.: On the structure of NP\(_{\mathbb C}\). SIAM J. Comput. 28(1), 27–35 (1999)
Michaux, C.: P ≠ NP over the nonstandard reals implies P ≠ NP over \(\bold R\). Theoret. Comput. Sci. 133(1), 95–104 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (2009). On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)