Pages that link to "Item:Q896108"
From MaRDI portal
The following pages link to Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108):
Displaying 9 items.
- On O(Tlog T) reduction from RAM computations to satisfiability (Q758197) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Solving QSAT in sublinear depth (Q2328327) (← links)
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach (Q3088068) (← links)
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492890) (← links)
