Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1453-1464
Abstract
No abstract availableAll Related Versions
Funding Information
- Polish National Science Centre (2023/51/B/ST6/01505)
- DFG (462679611)
- Miller Research Fellowship at the Miller Institute for Basic Research in Science, UC Berkeley (None)
This publication has 28 references indexed in Scilit:
- Strong Bounds for 3-Progressions2023
- Induced Cycles and Paths Are Harder Than You Think2022
- A tight (non-combinatorial) conditional lower bound for Klee’s Measure Problem in 3D2022
- An improved combinatorial algorithm for Boolean matrix multiplicationInformation and Computation, 2018
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems2014
- Additive Combinatorics2006
- A new proof of Szemerédi's theoremGeometric and Functional Analysis, 2001
- On the Exponent of the All Pairs Shortest Path ProblemJournal of Computer and System Sciences, 1997
- On a class of O(n2) problems in computational geometryComputational Geometry, 1995
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946