Recursion schemata for slowly growing depth circuit classes

DOI10.1007/S00037-004-0184-4MaRDI QIDQ1764156zbMATH OpenOpenAlexFDO

Authors 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 classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• scientific article; zbMATH DE number 3995649
• Recursion Schemata for NC k
• Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth
• scientific article; zbMATH DE number 176199
• Implicit recursion-theoretic characterizations of counting classes

Cited in

(4)

• CRN elimination and substitution bases for complexity classes
• scientific article; zbMATH DE number 3995649 (Why is no real title available?)
• scientific article; zbMATH DE number 7559295 (Why is no real title available?)
• Recursion Schemata for NC k

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764156)