The following pages link to On the complexity of \(k\)-SAT (Q5943094):
Displayed 33 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- (2+\(f\)(\(n\)))-SAT and its properties. (Q1421480) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Local reduction and the algebraic cryptanalysis of the block cipher GOST (Q2392058) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)