Pages that link to "Item:Q2581276"

The following pages link to A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276):

Displayed 50 items.

• Separating OR, SUM, and XOR circuits (Q269494) ‎ (← links)
• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) ‎ (← links)
• On exact algorithms for the permutation CSP (Q392031) ‎ (← links)
• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) ‎ (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) ‎ (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) ‎ (← links)
• Into the square: on the complexity of some quadratic-time solvable problems (Q737085) ‎ (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) ‎ (← links)
• Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) ‎ (← links)
• Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) ‎ (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) ‎ (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) ‎ (← links)
• Computing branchwidth via efficient triangulations and blocks (Q967315) ‎ (← links)
• On two techniques of combining branching and treewidth (Q1022343) ‎ (← links)
• Proofs of Work from worst-case assumptions (Q1673424) ‎ (← links)
• A note on hardness of diameter approximation (Q1705693) ‎ (← links)
• Quantum algorithm design: techniques and applications (Q1730317) ‎ (← links)
• A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) ‎ (← links)
• Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) ‎ (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) ‎ (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) ‎ (← links)
• Solving string problems on graphs using the labeled direct product (Q2088591) ‎ (← links)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) ‎ (← links)
• Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) ‎ (← links)
• \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) ‎ (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) ‎ (← links)
• Lengths of words accepted by nondeterministic finite automata (Q2203588) ‎ (← links)
• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) ‎ (← links)
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) ‎ (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) ‎ (← links)
• Tight conditional lower bounds for longest common increasing subsequence (Q2272597) ‎ (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) ‎ (← links)
• Longest common substring with approximately \(k\) mismatches (Q2414870) ‎ (← links)
• Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) ‎ (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) ‎ (← links)
• Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) ‎ (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) ‎ (← links)
• An exact algorithm for MAX-CUT in sparse graphs (Q2467485) ‎ (← links)
• A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) ‎ (← links)
• The complexity of binary matrix completion under diameter constraints (Q2678254) ‎ (← links)
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$ (Q2817854) ‎ (← links)
• New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) ‎ (← links)
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) ‎ (← links)
• On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) ‎ (← links)
• New upper bounds for the problem of maximal satisfiability (Q3225865) ‎ (← links)
• New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) ‎ (← links)
• On the Equivalence among Problems of Bounded Width (Q3452838) ‎ (← links)
• Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) ‎ (← links)
• The Time Complexity of Constraint Satisfaction (Q3503589) ‎ (← links)
• A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) ‎ (← links)