| No. |
Title |
Author |
Year |
| 1 |
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms |
Gajulapalli, Karthik et al. |
2023 |
| 2 |
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems |
Golovnev, Alexander et al. |
2023 |
| 3 |
Sketching Approximability of (Weak) Monarchy Predicates |
Chou, Chi-Ning et al. |
2022 |
| 4 |
Circuit Depth Reductions |
Golovnev, Alexander et al. |
2021 |
| 5 |
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications |
Golovnev, Alexander et al. |
2021 |
| 6 |
AC^0[p] Lower Bounds Against MCSP via the Coin Problem |
Golovnev, Alexander et al. |
2019 |
| 7 |
Collapsing Superstring Conjecture |
Golovnev, Alexander et al. |
2019 |
| 8 |
String Matching: Communication, Circuits, and Learning |
Golovnev, Alexander et al. |
2019 |
| 9 |
The Minrank of Random Graphs |
Golovnev, Alexander et al. |
2017 |
| 10 |
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework |
Golovnev, Alexander et al. |
2016 |
| 11 |
On the Limits of Gate Elimination |
Golovnev, Alexander et al. |
2016 |
