Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Describing Parameterized Complexity Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Automatizability of Resolution and Related Propositional Proof Systems
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Optimality of size-width tradeoffs for resolution
Computational Complexity
Describing parameterized complexity classes
Information and Computation
Annals of Mathematics and Artificial Intelligence
On the automatizability of resolution and related propositional proof systems
Information and Computation
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
Eulogy: Michael (Misha) Alekhnovich 1978-2006
ACM SIGACT News
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Note: The NP-hardness of finding a directed acyclic graph for regular resolution
Theoretical Computer Science
A Compressing Translation from Propositional Resolution to Natural Deduction
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
The parameterized complexity of probability amplification
Information Processing Letters
Data Compression for Proof Replay
Journal of Automated Reasoning
Note: Finding a tree structure in a resolution proof is NP-complete
Theoretical Computer Science
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Clause learning can effectively P-simulate general propositional resolution
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Artificial Intelligence
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Mean-payoff games and propositional proofs
Information and Computation
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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.