The following pages link to (Q5417690):
Displaying 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Efficiently approximating color-spanning balls (Q284593) (← links)
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Hardness of RNA folding problem with four symbols (Q1711829) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Some aspects of the database resilience (Q2119956) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q4993281) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- (Q5002674) (← links)
- (Q5002756) (← links)
- (Q5009597) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- Hardness Results for Seeding Complex Contagion with Neighborhoods (Q5050309) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- (Q5091230) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5121894) (← links)
- (Q5121902) (← links)
- (Q5136259) (← links)
