Recursion schemata for slowly growing depth circuit classes

DOI10.1007/s00037-004-0184-4zbMath1096.03047OpenAlexW2081380488MaRDI QIDQ1764156

Satoru Kuroda

Publication date: 23 February 2005

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-004-0184-4

zbMATH Keywords

circuit complexityfunction algebrabounded recursion schemata

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Unnamed Item

This page was built for publication: Recursion schemata for slowly growing depth circuit classes