Abstract
It is well known that the root, as well as the inverse function, of a one-to-one, polynomial-time computable real function fon [0,1] can be computed in polynomial time by binary search, if its inverse function has a polynomial modulus. We show that unless P = LOGSPACE the problem of inverting a one-to-one function cannot be done in log space even if the function f itself is log-space computable and its inverse function has a polynomial modulus.
Research supported in part by the NSF Grant CCR-8801575.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Book, Tally languages and complexity classes, Inform. Contr. 26 (1974), 186–193.
J. Buss, Relativized alternation, Proc. Structure in Complexity Theory Conf., Lecture Notes in Computer Science, 223 (1986), 66–76.
S. Cook, A taxonomy of problems with fast parallel algorithms, Inform. Contr. 64 (1985), 2–22.
H.J. Hoover, Feasibly Constructive Analysis, Ph.D. dissertation, Tech. Report 206/87, Department of Computer Science, University of Toronto, 1987. Inverting a Real Function 257
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, 1979.
K. Ko, On some natural complete operators, Theoret. Comput. Sci. 37 (1985), 1–30.
K. Ko, Applying techniques of discrete complexity theory to numerical computation, in Studies in Complexity Theory, R. Book, ed., Pitman, London,1986.
K. Ko, On continuous one-way functions, preprint.
K. Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1982), 323–352.
C. Wilson, A measure of relativized space which is faithful with respect to depth, J. Comput. System Sci. 36 (1986), 303–312.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Birkhäuser Boston
About this chapter
Cite this chapter
Ko, KI. (1990). Inverting a One-to-One Real Function Is Inherently Sequential. In: Buss, S.R., Scott, P.J. (eds) Feasible Mathematics. Progress in Computer Science and Applied Logic, vol 9. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3466-1_14
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3466-1_14
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3483-4
Online ISBN: 978-1-4612-3466-1
eBook Packages: Springer Book Archive