Note: Computational complexity of some restricted instances of 3-SAT
Discrete Applied Mathematics
Deciding relaxed two-colorability: a hardness jump
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Deciding relaxed two-colourability: A hardness jump
Combinatorics, Probability and Computing
A constructive proof of the Lovász local lemma
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
How many conflicts does it need to be unsatisfiable?
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Complexity results for linear XSAT-Problems
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Uniquely satisfiable k-SAT instances with almost minimal occurrences of each variable
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Extension Rule for Non-Clausal Propositional Calculus
Fundamenta Informaticae
On the complexity of path problems in properly colored directed graphs
Journal of Combinatorial Optimization
XSAT and NAE-SAT of linear CNF classes
Discrete Applied Mathematics
| Hi-index | 0.01 |