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: 41.4 GBP
Availability: InStock

Computer Science

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 23 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £41 (17 days, 73.9%)

Price range: £41 - £41

Price levels: 2 different prices over 23 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)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Logical Foundations of Proof Complexity (Perspectives in Logic)

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

Computational Complexity: A Conceptual Perspective

Computational Complexity: A Modern Approach

Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More

Proof and System-Reliability: v. 62 (NATO Science Series II)

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Proof Theory: Sequent Calculi and Related Formalisms (Discrete Mathematics and Its Applications)

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

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)

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

Type Theory and Formal Proof: An Introduction

How to Prove It: A Structured Approach

Mathematical Foundations of Computer Science

Communication Complexity: and Applications

The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut: 482 (London Mathematical Society Lecture Note Series, Series Number 482)

Mathematical Logic through Python

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Mathematical Logic with Special Reference to the Natural Numbers

Proof Techniques: The All in One Textbook (Haneul Choi Mathematics Textbooks)

Models and Computability: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 259 ... Lecture Note Series, Series Number 259)

Polygraphs: From Rewriting to Higher Categories: 495 (London Mathematical Society Lecture Note Series, Series Number 495)