The following pages link to On the complexity of \(k\)-SAT (Q5943094):
Displayed 50 items.
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)