The following pages link to On the complexity of \(k\)-SAT (Q5943094):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Efficiently approximating color-spanning balls (Q284593) (← links)
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- 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)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis (Q894453) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- (2+\(f\)(\(n\)))-SAT and its properties. (Q1421480) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Local reduction (Q1641001) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
