Pages that link to "Item:Q4625648"

The following pages link to Subcubic Equivalences Between Path, Matrix, and Triangle Problems (Q4625648):

Displaying 49 items.

• Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
• Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
• An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
• Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
• Tight bounds for reachability problems on one-counter and pushdown systems (Q2032173) (← links)
• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
• Finding the largest triangle in a graph in expected quadratic time (Q2184135) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Efficiently correcting matrix products (Q2408920) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
• Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
• Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
• Improved bounds for rectangular monotone min-plus product and applications (Q2681403) (← links)
• An experimental study on approximating \(k\) shortest simple paths (Q2828199) (← links)
• Efficiently Correcting Matrix Products (Q2942613) (← links)
• (Q3002808) (← links)
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
• Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
• (Q4638059) (← links)
• Conditional hardness for sensitivity problems (Q4638076) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
• From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
• (Q5075784) (← links)
• (Q5075809) (← links)
• (Q5091155) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
• (Q5111875) (← links)
• (Q5743440) (← links)
• (Q5743491) (← links)
• Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
• Parameterized aspects of triangle enumeration (Q5915757) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)
• (Q6065422) (← links)
• Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
• Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
• Shortest distances as enumeration problem (Q6184314) (← links)
• Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
• Finding the \(k\) shortest simple paths: time and space trade-offs (Q6579778) (← links)
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)
• Finding and counting small tournaments in large tournaments (Q6652454) (← links)
• Finer-grained reductions in fine-grained hardness of approximation (Q6658294) (← links)
• Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)