HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
+ PRICE WATCH
* Amazon pricing is not included in price watch
Bounded Arithmetic, Propositional Logic and Complexity Theory (Encyclopedia of Mathematics and its Applications) Book
This book presents an up-to-date, unified treatment of research in in this interdisciplinary subject with emphasis on independence proofs and lower bound proofs. A basic introduction is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. Then more advanced topics are treated, including Boolean complexity, witnessing theorems, and bounded arithmetic as a system of feasible arguments. Students and researchers in logic and computer science will find this an excellent guide to an expanding area.Read More
from£115.33 | RRP: * Excludes Voucher Code Discount Also available Used from £75.85
- 0521452058
- 9780521452052
- Jan Krajicek
- 24 November 1995
- Cambridge University Press
- Hardcover (Book)
- 360
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.
Would you like your name to appear with the review?
We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.
All form fields are required.