2 search results - page 1 / 1 » Extending Polynomial Calculus to $k$-DNF Resolution |
ECCC
2007
15 years 3 months ago
2007
134
click to vote
MST
2010
15 years 1 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...