The following pages link to (Q4228486):
Displayed 19 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- Network pollution games (Q1755784) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Parameterized Complexity (Q2841253) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- (Q5875468) (← links)
- PTAS for Sparse General-valued CSPs (Q6075749) (← links)