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 Cambridge University Press 1995 - xiv, 343 p. ; 24 cm.

Includes bibliographical references (p. 327-334) and indexes

ISBN: 9780521452052

ISSN: 94047054

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

Dewey Class. No.: 511.3 KRA

Print
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

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

Bounded arithmetic, propositional logic, and complexity theory

Find us on the map