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 (Group), DIMACS Workshop on Feasible Arithmetics and Length of Proofs, Rutgers University)
fromDIMACS series in discrete mathematics and theoretical compu…
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 (Group), DIMACS Workshop on Feasible Arithmetics and Length of Proofs, Rutgers University)
fromDIMACS series in discrete mathematics and theoretical compu…
The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations and what resources are necessary to make such inferences, questions that play a large role in computer science and artif…
These are the Proceedings of a Symposium on New Directions and Recent Results in Algorithms and Complexity held by the Computer Science Department, Carnegie-Mellon University, April 7-9, 1976. These proceedings contain 14 of the 16 invited papers presented. They also include t…
These are the Proceedings of a Symposium on New Directions and Recent Results in Algorithms and Complexity held by the Computer Science Department, Carnegie-Mellon University, April 7-9, 1976. These proceedings contain 14 of the 16 invited papers presented. They also include t…
