Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Bounded Arithmetic, Propositional Logic and Complexity Theory
- Binding:
- Hardback
- Pages:
- 360
- Published:
- November 24, 1995
- Dimensions:
- 236x159x31 mm.
- Weight:
- 672 g.
Delivery:
2-3 weeks
Expected delivery: September 7, 2024
About Jan (Academy of Sciences of the Czech Republic Krajicek
View all books by Jan (Academy of Sciences of the Czech Republic KrajicekDescription of Bounded Arithmetic, Propositional Logic and Complexity Theory
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.
User ratings of Bounded Arithmetic, Propositional Logic and Complexity Theory
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Bounded Arithmetic, Propositional Logic and Complexity Theory can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
