Pages that link to "Item:Q3459889"

The following pages link to Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889):

Displaying 17 items.

• Computing the longest common almost-increasing subsequence (Q2166775) (← links)
• Longest common subsequence in sublinear space (Q2656347) (← links)
• (Q4638059) (← links)
• The Complexity of Problems in P Given Correlated Instances (Q4638062) (← links)
• Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
• Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
• (Q5090981) (← links)
• (Q5091210) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5092429) (← links)
• (Q5111874) (← links)
• Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
• Approximating the Fréchet distance for realistic curves in near linear time (Q5405902) (← links)
• (Q5875463) (← links)
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)