Sciweavers

MST
2010
105views more  MST 2010»
13 years 3 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria