"13" Result
Sort By:
Proof complexity and feasible arithmetics: DIMACS workshop, April 21-24, 1996
by Center for Discrete Mathematics and Theoretical Computer Science (Piscataway, N.J.), Beame, Paul W., DIMACS Workshop on Feasible Arithmetics and Length of Proofs, DIMACS Special Year on Logic and Algorithms (1995-1996)
fromDIMACS series in discrete mathematics and theoretical compu…
0
Type: Book