2 search results - page 1 / 1 » Extending Polynomial Calculus to $k$-DNF Resolution |
64
Voted
ECCC
2007
14 years 11 months ago
2007
MST
2010
14 years 10 months ago
2010
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...