Skip to main content
Springer Nature Link
Log in

Function algebraic characterizations of the polytime functions

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

We give function algebraic characterizations of the polynomial time computable functions using unbounded recursion schemes without introducing extra notions such as safe and normal in variables and tiering in word algebras.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Author information

Authors and Affiliations

  1. School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-1292, Japan, e-mail: ishihara@jaist.ac.jp , , , , , , JP

    H. Ishihara

Authors
  1. H. Ishihara
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: December 9 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ishihara, H. Function algebraic characterizations of the polytime functions. Comput. complex. 8, 346–356 (1999). https://doi.org/10.1007/s000370050004

Download citation

  • Issue Date:

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