| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates | Mihajlin, Ivan et al. | 2022 |
| 2 | CNF Encodings of Parity | Emdin, Gregory et al. | 2022 |
| 3 | Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games | Ignatiev, Artur et al. | 2022 |
| 4 | Minimum Common String Partition: Exact Algorithms | Cygan, Marek et al. | 2021 |
| 5 | Toward Better Depth Lower Bounds: The XOR-KRW Conjecture | Mihajlin, Ivan et al. | 2021 |
| 6 | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds | Fomin, Fedor V. et al. | 2020 |
| 7 | Collapsing Superstring Conjecture | Golovnev, Alexander et al. | 2019 |
| 8 | Half-Duplex Communication Complexity | Hoover, Kenneth et al. | 2018 |
| 9 | Hardness Amplification for Non-Commutative Arithmetic Circuits | Carmosino, Marco L. et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |