Pages that link to "Item:Q4575668"
From MaRDI portal
The following pages link to Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky (Q4575668):
Displaying 32 items.
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) (← links)
- (Q4638059) (← links)
- (Q5005182) (← links)
- (Q5009542) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5090396) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- (Q5091168) (← links)
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
- (Q5091235) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q5092465) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- (Q5121894) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- (Q5240419) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- On Super Strong ETH (Q5856463) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- (Q5874553) (← links)
- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs (Q6102272) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)