Parameterized Complexity of DPLL Search Procedures
From MaRDI portal
Complexity of proofs (03F20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)
Recommendations
- Parameterized complexity of DPLL search procedures
- scientific article; zbMATH DE number 1161563
- Complexity results on DPLL and resolution
- Parameterized complexity of constraint satisfaction problems
- scientific article; zbMATH DE number 7650849
- On the parameterized complexity of dynamic problems
- On the Space Complexity of Parameterized Problems
- scientific article; zbMATH DE number 1424025
- Parameterized complexity of generalized domination problems
Cited in
(12)- Tight size-degree bounds for sums-of-squares proofs
- Cliques enumeration and tree-like resolution proofs
- Large clique is hard on average for resolution
- Scaling up DPLL(T) string solvers using context-dependent simplification
- A game characterisation of tree-like Q-resolution size
- A game characterisation of tree-like Q-resolution size
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms
- Resolution and the binary encoding of combinatorial principles
- Narrow proofs may be maximally long
- Parameterized complexity of DPLL search procedures
- Proof complexity and the binary encoding of combinatorial principles
- Proof complexity of modal resolution
This page was built for publication: Parameterized Complexity of DPLL Search Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892172)
