Skip to main content
SpringerLink
Log in

Structural analysis of the complexity of inverse functions

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

For a given polynomial-time computable honest function, the complexity of its “max” inverse function is compared with that of the other inverse functions. Two structural results are shown which suggest that the “max” inverse function is not the easiest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Balcázar, J. Diaz, and J. Gabarró,Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York (1988).

    Book  MATH  Google Scholar 

  2. R. Beigel. NP-hard sets are P-superterse unless R = NP. Technical Report 88-04, Department of Computer Science, The Johns Hopkins University.

  3. C. Bennett and J. Gill, Relative to a random oracleA, PA ≠ NPA ≠ co-NPA with probability 1,SIAM J. Comput. 10 (1981), 96–113.

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Buss and L. Hay, On truth-table reducibility to SAT and the difference hierarchy over NP, inProc. 3rd Structure in Complexity Theory Conference, IEEE, New York (1988), pp. 224–233.

    Google Scholar 

  5. J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, inProc. 25th IEEE Symposium on Foundations of Computer Science, IEEE, New York (1984), pp. 495–503; the final version appeared inSIAM J. Comput. 17 (1988), 309–335.

    Google Scholar 

  6. J. Kadin, The polynomial hierarchy collapses if the Boolean hierarchy collapses, inProc. 3rd Structure in Complexity Theory Conference, IEEE, New York (1988), pp. 278–292.

    Google Scholar 

  7. M. Krentel, The complexity of optimization problems,J. Comput. System Sci. 36 (1988), 490–509.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. Ladner, N. Lynch, and A. Selman, A comparison of polynomial time reducibilities,Theoret. Comput. Sci. 1 (1975), 103–123.

    Article  MathSciNet  MATH  Google Scholar 

  9. U. Schöning, Probabilistic complexity classes and lowness, inProc. 2nd Structure in Complexity Theory Conference, IEEE, New York (1987), pp. 2–8.

    Google Scholar 

  10. A. Selman, One-way functions in complexity theory, inProc. Mathematical Foundations of Computer Science 1990, Springer-Verlag, New York (1990), pp. 88–104.

    Google Scholar 

  11. A. Selman, A taxonomy of complexity classes of functions, submitted for publication.

  12. S. Tang and O. Watanabe, On tally relativizations ofBP-complexity classes,SIAM J. Comput. 18 (1989), 449–462.

    Article  MathSciNet  Google Scholar 

  13. S. Toda, On polynomial time truth-table reducibility of intractable sets to p-selective sets,Math. Systems Theory 24 (1991), 69–82.

    Article  MathSciNet  MATH  Google Scholar 

  14. L. Valiant, Relative complexity of checking and evaluating,Inform. Process. Lett. 5 (1976), 20–23.

    Article  MathSciNet  MATH  Google Scholar 

  15. L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions,Theoret. Comput. Sci. 47 (1986), 85–93.

    Article  MathSciNet  MATH  Google Scholar 

  16. K. Wagner, Bounded query computations, inProc. 3rd Structure in Complexity Theory Conference, IEEE, New York (1988), pp. 260–277.

    Google Scholar 

  17. O. Watanabe, A comparison of polynomial time completeness notions,Theoret. Comput. Sci. 54 (1987), 249–265.

    Article  MathSciNet  MATH  Google Scholar 

  18. O. Watanabe and S. Toda, Structural Analyses on the complexity of inverting functions, inProc. International Symposium SIGAL '90, Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, New York (1990), pp. 31–38.

    Google Scholar 

  19. S. Zachos, Probabilistic quantifiers and games,J. Comput. System Sci. 36 (1988), 433–451.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, 152, Tokyo, Japan

    Osamu Watanabe

  2. Department of Computer Science, University of Electro-Communications, Chofu-shi, 182, Tokyo, Japan

    Seinosuke Toda

Authors
  1. Osamu Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seinosuke Toda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Watanabe, O., Toda, S. Structural analysis of the complexity of inverse functions. Math. Systems Theory 26, 203–214 (1993). https://doi.org/10.1007/BF01202283

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01202283

Keywords

Search

Navigation