Counting problems in bounded arithmetic
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 317-340
- https://doi.org/10.1007/bfb0075316
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Classes of Predictably Computable FunctionsTransactions of the American Mathematical Society, 1963