3810337
9780521452052
Bounded Arithmetic, Propositional Logic and Complexity Theory
by Krajicek, Jan, Rota, G. -C., Doran, B.
31245
List Price
Discount
8% Off
You Save
$12.83
About this item
- Condition: New
- Provider: LightningBooks Contact
- Provider Rating: 85%
- Ships From: Multiple Locations
- Shipping: Standard, Expedited (tracking available)
- Comments: Fast shipping! All orders include delivery confirmation.
552610
List Price
Discount
30% Off
You Save
$47.94
About this item
- Condition: Good
- Provider: 369pyramidinc Contact
- Provider Rating: 75%
- Ships From: Multiple Locations
- Shipping: Standard
- Comments: This particular book, a readable and intact copy, is no exception. Despite showing noticeable wear and tear, particularly on the spine, it stands as a testament to the journey it has undertaken through various hands and minds. This essay delves into the details of this book's condition, exploring the implications of its wear, the presence of notes and highlights, and the significance of its role as a reading copy.
Product details
- ISBN-13: 9780521452052
- ISBN: 0521452058
- Publisher: Cambridge University Press
AUTHOR
SUMMARY
An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.Krajicek, Jan is the author of 'Bounded Arithmetic, Propositional Logic and Complexity Theory' with ISBN 9780521452052 and ISBN 0521452058.
[read more]
The ValoreBooks Guarantee
With our dedicated customer support team, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.
