Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Does more connectivity help groups to solve social problems
Proceedings of the 12th ACM conference on Electronic commerce
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On moderately exponential time for SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |