Pages that link to "Item:Q5363029"

The following pages link to More Applications of the Polynomial Method to Algorithm Design (Q5363029):

Displaying 27 items.

• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
• Dynamic and internal longest common substring (Q2211363) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← 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)
• A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
• (Q3305351) (← links)
• (Q4638059) (← links)
• (Q5002674) (← links)
• (Q5009621) (← links)
• Longest common substring made fully dynamic (Q5075739) (← links)
• (Q5090396) (← links)
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
• (Q5090981) (← links)
• Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5092465) (← links)
• (Q5121902) (← links)
• (Q5136259) (← links)
• Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
• (Q5874553) (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
• Near-optimal quantum algorithms for string problems (Q6174814) (← links)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
• Computing generalized convolutions faster than brute force (Q6185947) (← links)