Abstract
In this paper we investigate the complexity of inverting polynomial-time computable functions by methods developed in structural complexity theory. We first analyze upper bounds of the complexity of inverse functions by using complexity classes of functions. We prove the following: (1) NP/bit (the class of functions whose each bit is NP computable) is an upper bound for inverting honest and one-to-one functions, and (2) relative to almost all oracle, the class PF NPtt (the class of functions that are polynomial time computable by asking non-adaptive queries to an NP oracle) is an upper bound for inverting honest functions. Next we investigate relative complexity of inverse functions by using polynomial-time reducibility of functions. We prove that an honest function is NP/bit invertible if the class of its inverse functions possesses the least element under polynomial-time non-adaptive one-query reducibility.
(Extended Abstract)
watanabecs.titech.ac.jp
todacso.cs.uec.ac.jp
Preview
Unable to display preview. Download preview PDF.
References
E. Allender, Isomorphisms and 1-L reductions, in “Proc. 1st Structure in Complexity Theory Conference”, Lecture Notes in Computer Science 223, Springer-Verlag, Berlin (1986), 12–22; the final version appeared in J. Comput. Syst. Sci. 36 (1988), 336–350.
J. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1988).
R. Beigel, Bounded queries to SAT and Boolean hierarchy, Technical Report 87-07, Dept. Computer Science, The Johns Hopkins University (1987).
R. Beigel, NP-hard sets are P-superterse unless R = NP, Technical Report 88-04, Dept. Computer Science, The Johns Hopkins University (1988).
S. Buss and L. Hay, On truth-table reducibility to SAT and the difference hierarchy over NP, in “Proc. 3rd Structure in Complexity Theory Conference”, IEEE (1988), 224–233.
J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, in “Proc. 25th IEEE Sympos. Foundation of Comput. Sci.”, IEEE (1984), 495–503; the revised version appeared in SIAM J. Comput. 17 (1988), 309–335.
L. Hemachandra, The strong exponential hierarchy collapses, in “Proc. 19th Ann. ACM Sympos. on Theory of Computing”, ACM (1987), 110–122.
J. Kadin, The polynomial time hierarchy collapses if the Boolean hierarchy collapses, in “Proc. 3rd Structure in Complexity Theory Conference”, IEEE (1988), 278–292.
M. Krentel, The complexity of optimization problems, in “Proc. 18th Ann. ACM Sympos. on Theory of Computing”, ACM (1986), 69–76; the final version appeared in J. Comput. Syst. Sci. 36 (1988), 490–509.
S. Toda, On polynomial time truth-table reducibilities of intractable sets to p-selective sets, Theoret. Comput. Sci. (1990), to appear.
L. Valiant, Relative complexity of checking and evaluating, Inform. Process. Lett. 5 (1976), 20–23.
K. Wagner, Number-of-query hierarchies, Technical Report TR-158, Institute of Mathematics, University of Augsburg (1987).
O. Watanabe, On hardness of one-way functions, Inform. Process. Lett. 27 (1988), 151–157.
O. Watanabe, On 1-tt-sparseness of nondeterministic complexity classes, in “Proc. 15th International Colloquium on Automata, Languages and Programming”, Lecture Notes in Computer Science 317, (1988), 697–709.
O. Watanabe, On one-way functions, in “Combinatorics, Computing and Complexity”, D. Du and G. Hu eds., Kluwer Academic Pub. (1989), 98–131.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, O., Toda, S. (1990). Structural analyses on the complexity of inverting functions. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_53
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive