Bounded Arithmetic Propositional Logic and Complexity Theory by Jan Kr
In stock
Smart shoppers OnBuy it!
- Earn Cashback on every purchase – spend it instantly on your next order
- Free delivery – on millions of items across the site
- Customers love us – 133,000 Trustpilot reviews and an 'Excellent' rating
Interest-free payment options available
See full product description & details
Delivery: Standard (Free) | Thu 17th - Sat 19th Sep
Sold by: Ria Christie Collections
Returns: 30 days
180-day payment protection
Bounded Arithmetic Propositional Logic and Complexity Theory by Jan Kr Description
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.
Details
| OPC | PXCPH22 |
|---|---|
| Brand | riachristiecollections |
| Codes | 0521452058 (ISBN-10) |
| 9780521452052 (ISBN) | |
| MPN | 9780521452052 |
Compare Sellers for Bounded Arithmetic Propositional Logic and Complexity Theory by Jan Kr
- New from £179.41
| Seller | Ratings | Warranty | Returns | Price | Delivery | Total | Quantity |
|---|---|---|---|---|---|---|---|
| (207 reviews) | - |
30 Days
Free Returns No
|
£179.41
|
+Free Delivery
Est. Delivery:
17th-19th Sep
|
£179.41
|
Earn as you shop with instant Cashback on everything.
No catch, no cost
- Paid into your OnBuy account
- Spend it on your next purchase
- Save it or withdraw it
Become a Cashback VIP
Just 1 purchase unlocks bigger deals & rates