Free Shipping to all UK customers for orders over £25.00

0 Total items on my wish-list.

Free Shipping to all UK customers for orders over £25.00

Ryefieldbooks Logo

Ryefield Books

Free Shipping to all UK customers for orders over £25.00

Ryefieldbooks Logo

Ryefield Books

Contact Us
[email protected]
© Copyright Ryefield Books - All Right Reserved
Product Categories
My Shopping Cart
Void image

You shopping cart is empty

You may browse our offerings to locate what you're
searching for, then put it in your shopping cart.

Book cover image

Bounded Arithmetic, Propositional Logic and Complexity Theory

Usually dispatched within 3 - 5 business days.

In Stock (111)

£ 160.80

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.

Book Details
EAN:
9780521452052
Binding:
Hardback
Dimensions(mm):
159 x 236 x 31
Publication Date:
1995-11-24
Publication Country:
United Kingdom