Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497) - Softcover
Synopsis
Discover a state-of-the-art theory aiming to construct hard propositional tautologies needed to solve the NP vs. coNP problem.
"synopsis" may belong to another edition of this title.
About the Author
Jan Krajíček is Professor of Mathematical Logic at Charles University, Prague. A member of the Learned Society of the Czech Republic and the Academia Europaea, he has previously published three books with Cambridge University Press (1995, 2011 and 2019).
"About this title" may belong to another edition of this title.
Search results for Proof Complexity Generators: Series Number 497 (London...
Stock Image
Proof Complexity Generators
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 49380939-n
Stock Image
Proof Complexity Generators (Paperback)
Published by
Cambridge University Press, Cambridge, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research. This book presents a state-of-the-art theory in the field of proof complexity, aiming to construct hard propositional tautologies needed to solve the P vs. NP problem in the negative. The theory is introduced step by step, starting with the historic background, and several potential new avenues of research are highlighted. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781009611701
Stock Image
Proof Complexity Generators
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781009611701
Stock Image
Proof Complexity Generators
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781009611701
Buy New
Ł 43.75
Ł 4.16 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Seller Image
Proof Complexity Generators
Published by
Cambridge University Press, GB, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research. Seller Inventory # LU-9781009611701
Buy New
Ł 48.78
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Proof Complexity Generators
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
Used
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 49380939
Stock Image
Proof Complexity Generators (London Mathematical Society Lecture Note Series, Series Number 497)
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9781009611701
Stock Image
PROOF COMPLEXITY GENERATORS
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Softcover
Seller: Speedyhen LLC, Hialeah, FL, U.S.A.
Seller rating 2 out of 5 stars
Condition: NEW. Seller Inventory # NWUS9781009611701
Stock Image
Proof Complexity Generators
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Softcover
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEOCT25-318074
Stock Image
Proof Complexity Generators (London Mathematical Society Lecture Note Series, Series Number 497)
Published by
Cambridge University Press, 2025
ISBN 10: 1009611704
ISBN 13: 9781009611701
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781009611701_new
Buy New
Ł 43.59
Ł 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 5 available