Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits.
Create an account for free
Contact
How to shop
Help
Delivery
DPD courier 4.99 €
GLS courier 9.99 €
Shopping guide
My account
▸
Empty :-(
0
Proof Complexity and Feasible Arithmetics
Language
English
English
Book
Hardback
Contains papers that represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and P...
Full description
Libristo code: 06367835
?
244 b
244 b
100.50
€
50 % chance
We search the world
When will I receive my book?
Up to 30 days for returns
Contains papers that represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book covers a number of aspects of the field, including lower bounds in proof complexity.
Actress
&
Polyglot
EWA KASP
for
Play video
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.
About the book
Full name
Proof Complexity and Feasible Arithmetics
Author
Paul W. Beame, Samuel R. Buss
Language
English
English
Binding
Book - Hardback
Date of issue
1997
Number of pages
320
EAN
9780821805770
ISBN
9780821805770
Libristo code
06367835
Publishers
American Mathematical Society
Weight
784
Dimensions
262 x 211 x 22
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's address
Book advisor Libroamiko
By using this chat, you are communicating with generative artificial intelligence. By using it, you also agree to the processing of personal data.
Hi! I'm Libroamiko, your book advisor.
How can I help you?
Hi, I'm Libroamiko, can I help?