Resolution Is Not Automatizable Unless W[P] Is Tractable

  title={Resolution Is Not Automatizable Unless W[P] Is Tractable},
  author={Michael Alekhnovich and Alexander A. Razborov},
  journal={SIAM J. Comput.},
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 randomized algorithms with one-sided error. 
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
63 Citations
21 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 63 extracted citations

99 Citations

Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 21 references


  • M. Alekhnovich, A. Razborov
  • branch-width and Tseitin tautologies, in…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…