Pages that link to "Item:Q4575670"

The following pages link to Higher Lower Bounds from the 3SUM Conjecture (Q4575670):

Displaying 26 items.

• Ranked document retrieval for multiple patterns (Q1784746) (← links)
• Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
• Dynamic data structures for timed automata acceptance (Q2093569) (← links)
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
• Online recognition of dictionary with one gap (Q2216131) (← links)
• Mind the gap! (Q2414857) (← links)
• Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
• Gapped indexing for consecutive occurrences (Q2696274) (← links)
• Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• (Q4638076) (← links)
• Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
• (Q5002673) (← links)
• A subquadratic algorithm for 3XOR (Q5005162) (← links)
• (Q5009597) (← links)
• On Multidimensional and Monotone k-SUM (Q5111265) (← links)
• Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
• (Q5116497) (← links)
• (Q5121902) (← links)
• The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
• Range closest-pair search in higher dimensions (Q5896868) (← links)
• Parameterized aspects of triangle enumeration (Q5915757) (← links)
• Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
• How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
• Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
• \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)