Proof complexity and feasible arithmetics: DIMACS workshop, April 21-24, 1996
by Buss, Samuel R., NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, Beame, Paul W., DIMACS Workshop on Feasible Arithmetics and Length of Proofs, Rutgers University), American Mathematical Society, DIMACS (Groupe)
fromDIMACS series in discrete mathematics and theoretical compu…