Bounded arithmetic for NC, ALogTIME, L and NL
- 1 April 1992
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 56 (1-3) , 73-117
- https://doi.org/10.1016/0168-0072(92)90068-b
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Arithmetizing Uniform NCAnnals of Pure and Applied Logic, 1991
- On parameter free induction schemasThe Journal of Symbolic Logic, 1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977