Skip to main content
SpringerLink
Log in

Recursion Theoretic Operators for Function Complexity Classes

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

  • 1276 Accesses

Abstract

We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes based on recursive function theory and construct an operator which generates FPSPACE from FP. Then, we introduce new function classes composed of functions whose output lengths are bounded by the input length plus some constant. We characterize FP and FPSPACE by using these classes and operators. Finally, we define a new notion of completeness for FPSPACE and show a FPSPACE-complete function.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rose, H.E.: Subrecursion: Functions and Hierarchies. Claredon Press (1984)

    Google Scholar 

  2. Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  3. Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Mathematyczne 4 (1953)

    Google Scholar 

  4. Ritchie, R.W.: Classes of predictably computable functions. Transactions of the American Mathematical Society 106, 139–173 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cobham, A.: The intrinsic computational difficulty of functions. In: Proceedings of the 1964 Congress for Logic, Methodology, and the Philosophy of Science, pp. 24–30. North-Holland, Amsterdam (1964)

    Google Scholar 

  6. Thompson, D.B.: Subrecursiveness: Machine-independent notions of computability in restricted time and storage. Mathematical Systems Theory 6, 3–15 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ogiwara, M., Hemachandra, L.A.: A complexity theory for feasible closure properties. In: Structure in Complexity Theory Conference, pp. 16–29 (1991)

    Google Scholar 

  9. Vollmer, H., Wagner, K.: Classes of counting functions and complexity theoretic operators. Technical report, Universitat Wurzburg (1991)

    Google Scholar 

  10. Zachos, S., Pagourtzis, A.: Combinatory complexity: Operators on complexity classes. In: Proceedings of 4th Panhellenic Logic Symposium (2003)

    Google Scholar 

  11. Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20, 865–877 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  12. Selman, A.L.: Much ado about functions. In: Proceedings, Eleventh Annual IEEE Conference on Computational Complexity, pp. 198–212 (1996)

    Google Scholar 

  13. Ladner, R.E.: Polynomial space counting problems. SIAM Journal on Computing 18, 1087–1097 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I, 2nd edn. Springer, Heidelberg (1994)

    Google Scholar 

  15. Selman, A.L., Xu, M.R., Book, R.V.: Positive relativizations of complexity classes. SIAM Journal on Computing 12, 565–579 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hopcroft, J.E., Paul, W., Valiant, L.G.: On time versus space. Journal of the ACM 24, 332–337 (1977)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Graduate School of Information Science and Technology, the University of Tokyo,  

    Kenya Ueno

Authors
  1. Kenya Ueno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ueno, K. (2005). Recursion Theoretic Operators for Function Complexity Classes. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_75

Download citation

  • DOI: https://doi.org/10.1007/11602613_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation