Skip to product information
1 of 1

Proof Complexity and Feasible Arithmetics

Proof Complexity and Feasible Arithmetics

Hardback

Regular price £83.64
Regular price Sale price £83.64

Join our rewards scheme and earn reward points on this purchase!

Earn points on this!

Sign in or Sign up!
View full details
  • Release Date: 30/11/1997
  • Barcode: 9780821805770
  • Imprint: American Mathematical Society
  • Publisher: American Mathematical Society
Proof Complexity and Feasible Arithmetics

Proof Complexity and Feasible Arithmetics

Collapsible content

DESCRIPTION

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.
Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether logical inferences can be made, but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of whether NP is equal to co-NP. In addition, these have important implications for the efficiency of automated reasoning systems. The last dozen years have seen several breakthroughs in the study of these resource requirements.Papers in this volume 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 brings together some of the most recent work of leading researchers in proof complexity and feasible arithmetic reflecting many of these advances. It covers a number of aspects of the field, including lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, interpolation theorems, and the relationship between proof complexity and Boolean circuit complexity.

ADDITIONAL DETAILS

  • Contributor: Paul W. Beame (Edited by), Samuel R. Buss (Edited by)
  • DELIVERY & RETURNS

    UK Delivery:

    • Free delivery on all orders of £10 or more.
    • £1.49 delivery fee on orders below £10.
    • UK orders are shipped via Royal Mail 2nd Class.

    International Delivery:

    • Flat rate delivery charges vary by country.

    Dispatch and Delivery Times:

    • All orders are shipped from our warehouse in Northampton, UK as soon as stock is available.
    • UK mainland orders typically arrive within 3-7 working days via Royal Mail 2nd Class.
    • International estimated delivery times:
    • Europe & Channel Islands: 7 to 10 working days
    • USA: 7 to 15 working days
    • Rest of the World: 9 to 30 working days

    View our full delivery infomation here.

    • OVER

      2 MILLION PRODUCTS

    • 60 MILLION CUSTOMERS

      ACROSS 190 COUNTRIES