No article text was recorded for this version.
minimax lower bound analysis
Version 1 of 129 papers31 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Adaptivity Helps for Testing Juntas
- Blog: Randomized Lower Bounds for Online Path Coloring
- Blog: Equivocal Blends: Prior Independent Lower Bounds
- Blog: Property testing for cyclic groups and beyond
- Blog: A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization
- Blog: Bounds for the Query Complexity of Approximate Equilibria
- Blog: Communication Complexity (for Algorithm Designers)
- Blog: Query complexity of tournament solutions
- Blog: Quantum Certificate Complexity
- Blog: When Distributed Computation Is Communication Expensive
- Blog: The Sharp Power Law of Local Search on Expanders
- Blog: Almost Tight Bounds for Online Hypergraph Matching
- Blog: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
- Blog: Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths
- Blog: An optimal lower bound for monotonicity testing over hypergrids
- Blog: Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay
- Blog: Errata for: "On randomized one-round communication complexity"
- Blog: No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation
- Blog: Bandits with switching costs: T2/3 regret
- Blog: Learning Convex Bodies is Hard
- Blog: Erratum to: Greedy Matching: Guarantees and Limitations
- Blog: On the Robust Communication Complexity of Bipartite Matching
- Blog: Testing ±1-weight halfspace
- Blog: A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube
- Blog: Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Blog: On the Power of Randomization for Obviously Strategy-Proof Mechanisms
- Blog: Ranking-Based Black-Box Complexity
- Blog: Auctions with online supply
- Blog: Min-Cost Bipartite Perfect Matching with Delays
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_minimax_lower_bound_analysis_7db12213,
title = {minimax lower bound analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-lower-bound-analysis/rdr_7db12213fe9542299d7413eacff12514},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_minimax_lower_bound_analysis_7db12213_v1,
title = {minimax lower bound analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-lower-bound-analysis/rdr_7db12213fe9542299d7413eacff12514/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}