Normal view MARC view ISBD view

Bounded arithmetic, propositional logic, and complexity theory /

Krajíček, Jan.

Bounded arithmetic, propositional logic, and complexity theory / Jan Krajicek. - Cambridge [England] ; New York, NY, USA : Cambridge University Press, 1995. - xiv, 343 p. ; - Encyclopedia of mathematics and its applications .

ISBN: 0521452058

Subjects--Topical Terms:
Constructive mathematics.
Proposition (Logic)
Computational complexity.

LC Class. No.: QA9.56 / .K73 1995

Print
Add to your cart (remove)
Suggest for purchase
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

KARATINA UNIVERSITY LIBRARY

Bounded arithmetic, propositional logic, and complexity theory /