Proof Complexity and Feasible Arithmetics

Language: English

Published by American Mathematical Society, US, 1997

0821805770 / 9780821805770

  • Hardcover
  • New
See all details

Seller: Rarewaves.com USA, London, London, United KingdomRarewaves.com USA

5-star seller

AbeBooks seller since June 11, 2025

Hardcover

Condition: New

£ 91.95

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

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.…

Seller Inventory # LU-9780821805770

Title
Proof Complexity and Feasible Arithmetics
Author
Paul W. Beame
Publisher
American Mathematical Society, US
Publication year
1997
Condition
New
Binding
Hardback
Language
English
ISBN 10
0821805770
ISBN 13
9780821805770
Item weight
780 grams

Rarewaves.com USA

London, London, United Kingdom

5-star seller

AbeBooks seller since June 11, 2025

Shipping rates from United Kingdom to U.S.A.

Item12 to 17 business days12 to 17 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, United Kingdom W1W 8BE