3 search results - page 1 / 1 » Resolution Is Not Automatizable Unless W[P] Is Tractable |
SIAMCOMP
2008
14 years 11 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
99
Voted
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...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...