Skip to main content
SpringerLink
Log in

Recursion Schemata for Slowly Growing Depth Circuit Classes

  • Original Paper
  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

We characterize iterated log depth circuit classes between AC0 and AC1 by Cobham-like bounded recursion schemata. We also give alternative characterizations which utilize the safe recursion method developed by Bellantoni and Cook.

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

Author information

Authors and Affiliations

  1. Gunma Prefectural Women’s University, 1395-1, Kaminote, Tamamura-machi, Sawagun, Gunma, 370-1193, Japan

    Satoru Kuroda

Authors
  1. Satoru Kuroda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoru Kuroda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuroda, S. Recursion Schemata for Slowly Growing Depth Circuit Classes. comput. complex. 13, 69–89 (2004). https://doi.org/10.1007/s00037-004-0184-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-004-0184-4

Keywords.

Subject classification.

Search

Navigation