Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497) - Image 1

£40.86

Cambridge University Press Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)

Name: Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)
Brand: Cambridge University Press
Price: 40.86 GBP
Availability: InStock

Computer Science

About as cheap as it gets. The only time it was cheaper was 7 months ago.

£41 today · all-time low £41 (Nov 2025) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 108 days • 108 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 108 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £41 (98 days, 90.7%)

Price range: £41 - £43

Price levels: 2 different prices over 108 days

Description

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.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 1009611704
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 26 June 2025
Listed Since: 25 November 2024

Barcode

No barcode data available

Cambridge University Press Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)

About as cheap as it gets. The only time it was cheaper was 7 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Logical Foundations of Proof Complexity (Perspectives in Logic)

Basic Proof Theory 2ed: 43 (Cambridge Tracts in Theoretical Computer Science, Series Number 43)

Proof and Computation: 139 (NATO ASI Subseries F:, 139)

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Proof Complexity: 170 (Encyclopedia of Mathematics and its Applications, Series Number 170)

Mathematical Logic: Exercises and Solutions (Problem Books in Mathematics)

Propositional Logics Third Edition

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Mathematical Logic through Python

Part 1: Propositional Calculus, Boolean Algebras, Predicate Calculus, Completeness Theorems: A Course with Exercises Part I: Propositional Calculus, ... Completeness Theorems (Mathematical Logic)

Classical and Fuzzy Concepts in Mathematical Logic and Applications, Professional Version

New Directions in Paraconsistent Logic: 5th WCP, Kolkata, India, February 2014: 152 (Springer Proceedings in Mathematics & Statistics, 152)

SAT 2005: Satisfiability Research in the Year 2005

Springer SAT 2005: Satisfiability Research in the Year 2005

Logic for Computer Science and Artificial Intelligence

Mathematics of Discrete Structures for Computer Science

Sets and Proofs: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 258 (London ... Lecture Note Series, Series Number 258)

Computational Logic: 165 (NATO ASI Subseries F:, 165)

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Logic and Implication: An Introduction to the General Algebraic Study of Non-classical Logics: 57 (Trends in Logic, 57)

Linear Logic in Computer Science: 316 (London Mathematical Society Lecture Note Series, Series Number 316)

Proof And Computation: Digitization In Mathematics, Computer Science, And Philosophy

Éléments de mathématiques pour le XXIe siècle, volume 1: Fondements des mathématiques 1 (logique des propositions et des prédicats, systèmes déductifs ... de Peano, structures algébriques de base)

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications