Recursion schemata for slowly growing depth circuit classes

Authors:
Satoru Kuroda
Affiliations:
Gunma Prefectural Women's University, 1395-1, Kaminote, Tamamura-machi, Swagun, Gunma, 370-1193, Japan
Venue:
Computational Complexity
Year:
2004

Citing 6
Cited 0

Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
Function-algebraic characterizations of log and polylog parallel time

Computational Complexity
Improved depth lower bounds for small distance connectivity

Computational Complexity
Computational Models and Function Algebras

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.