496 pages • missing pub info (editions)
ISBN/UID: 9781107694118
Format: Paperback
Language: English
Publisher: Cambridge University Press
Publication date: 06 March 2014
Description
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. A...
Community reviews
This book doesn't have any reviews or ratings yet!
If you've read it, mark it as 'read' and add a review to help others in the StoryGraph community figure out if it might be a book for them!
Content Warnings
This book doesn't have any content warnings yet!
If you're the author of this book and want to add author-approved content warnings, please email us at [email protected] to request the content warning form.
496 pages • missing pub info (editions)
ISBN/UID: 9781107694118
Format: Paperback
Language: English
Publisher: Cambridge University Press
Publication date: 06 March 2014
Description
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. A...
Community reviews
This book doesn't have any reviews or ratings yet!
If you've read it, mark it as 'read' and add a review to help others in the StoryGraph community figure out if it might be a book for them!
Content Warnings
This book doesn't have any content warnings yet!
If you're the author of this book and want to add author-approved content warnings, please email us at [email protected] to request the content warning form.