Proof Complexity and Feasible Arithmetics
Изчерпано количество
Продуктът не е наличен
Запиши се за известие при зареждане
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.
Информация за "Proof Complexity and Feasible Arithmetics"
- SKU 9780821805770
- Weight 0.780000
- ISBN 9780821805770
- Вид корица Hardback
- Издателство American Mathematical Society
- Брой страници 320
The information below is required for social login