Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
Improving a fixed parameter tractability time bound for the shadow problem
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Hi-index | 0.00 |