Opening book details…
About this Computer Science article
Krajíček Jan, Pudlák Pavel, and Takeuti Gaisi. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52 (1991), pp. 143–153.Buss Samuel R.. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75 (1995), pp. 67–77.Zambella Domenico. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61 (1996), pp. 942–966 by Cook, Stephen is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Cook, Stephen
- Publisher
- Association for Symbolic Logic; Cambridge University Press; Cambridge University Press (CUP) (ISSN 0022-4812)
- Published
- 1999
- Language
- EN
- Field
- Computer Science (Physical Sciences)