9780821805770 - proof complexity and feasible arithmetics: dimacs workshop april 21-24, 1996 (dimacs series in discrete mathematics and theoretical computer science, 39, band 39) von dimacs (group); nsf science and technology center in discrete mathematics and theoretical computer science; dimacs workshop on feasible arithmetics and length of proofs (1996 : rutgers university) (2 Ergebnisse)

Zustand: New. 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 bound…