- Start
- Proof Complexity and Feasible Arithmetics
Proof Complexity and Feasible Arithmetics
Angebote / Angebote:
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.
Fremdlagertitel. Lieferzeit unbestimmt