ARITHMETIC, PROOF THEORY AND COMPUTATIONAL COMPLEXITY by KRAJICEK, JAN (MATHEMATICAL INSTITUTE, CESKOSLOVENSKA AKADEM ISBN 0198536909

From Student Book World

Jump to: navigation, search

Contents

[edit] ARITHMETIC, PROOF THEORY AND COMPUTATIONAL COMPLEXITY

This book principally concerns the area of 'Logical Complexity Theory', the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.


[edit] Book Details

[edit] Title

ARITHMETIC, PROOF THEORY AND COMPUTATIONAL COMPLEXITY

[edit] Author

KRAJICEK, JAN (MATHEMATICAL INSTITUTE, CESKOSLOVENSKA AKADEM

[edit] ISBN

0198536909

[edit] Published

06/05/1993

[edit] Publisher

Oxford University Press

[edit] Binding

hardback

[edit] Retail Price

78 (GBP)

[edit] Typical Price Online

78 (GBP)

[edit] Buy Book Online

If you wish to purchase ARITHMETIC, PROOF THEORY AND COMPUTATIONAL COMPLEXITY, written by KRAJICEK, JAN (MATHEMATICAL INSTITUTE, CESKOSLOVENSKA AKADEM and published by Oxford University Press on 06/05/1993 then we have listed a few select online book retailers who can provide good value and service.

ISBN 0198536909


This section is supported by pay as you go sim card providers; IDT Mobile, Nomi Mobile , Lebara Mobile and Planet Talk Instant Dial Service.
Personal tools