Explore the latest books of this year!
Bookbot

Bounded Arithmetic, Propositional Logic and Complexity Theory

Book rating

5.0(3)Add rating

Parameters

  • 360 pages
  • 13 hours of reading

More about the book

Exploring the intricate relationship between logic and complexity theory, this book delves into foundational concepts and presents a variety of compelling open problems in the field. It challenges readers to consider the implications of these connections and encourages further investigation into unresolved questions that could shape future research.

Book purchase

Bounded Arithmetic, Propositional Logic and Complexity Theory, Jan Krajicek

Language
Released
2004
product-detail.submit-box.info.binding
(Hardcover)
We’ll email you as soon as we track it down.

Payment methods

5.0
Excellent
3 Ratings

We’re missing your review here.