Pages that link to "Item:Q5259602"

The following pages link to Faster all-pairs shortest paths via circuit complexity (Q5259602):

Displaying 44 items.

• Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
• An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
• Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
• Average-case complexity of the min-sum matrix product problem (Q897863) (← links)
• Hardness of RNA folding problem with four symbols (Q1711829) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• A spectral approach to the shortest path problem (Q2020688) (← links)
• Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
• Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
• Percolation centrality via Rademacher Complexity (Q2091801) (← links)
• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs (Q2195978) (← links)
• Approximating the minimum cycle mean (Q2253203) (← links)
• Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
• Subquadratic algorithms for succinct stable matching (Q2415371) (← 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)
• Improved bounds for rectangular monotone min-plus product and applications (Q2681403) (← links)
• Anti-concentration for polynomials of independent random variables (Q2830871) (← links)
• Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
• Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
• (Q5002674) (← links)
• (Q5009621) (← links)
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
• Smallest k-enclosing rectangle revisited (Q5088950) (← links)
• (Q5090377) (← links)
• (Q5090378) (← links)
• (Q5090396) (← links)
• Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
• (Q5091161) (← links)
• (Q5091168) (← links)
• (Q5091199) (← links)
• (Q5091235) (← links)
• Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
• (Q5121902) (← links)
• The idemetric property: when most distances are (almost) the same (Q5160620) (← links)
• (Q5240419) (← links)
• A Sparsified Four-Russian Algorithm for RNA Folding (Q5283833) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)