Bounded arithmetic, propositional logic, and complexity theory
By: Jan Krajicek.
Series: Encyclopedia of mathematics and its applications
Publisher: Cambridge University Press
Published: 1995
Place of publication: Cambridge [England]; New York, NY, USA
Language: eng
Number of pages: 343
Subjects: Constructive mathematics.; Proposition (Logic); Computational complexity.
Notes: Includes bibliographical references (p. 327-334) and indexes.