| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Hardness of Constant-Round Communication Complexity | Hirahara, Shuichi et al. | 2021 |
| 2 | Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p] | Ilango, Rahul | 2020 |
| 3 | Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas | Ilango, Rahul | 2020 |
| 4 | NP-Hardness of Circuit Minimization for Multi-Output Functions | Ilango, Rahul et al. | 2020 |
| 5 | AC^0[p] Lower Bounds Against MCSP via the Coin Problem | Golovnev, Alexander et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |