| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Circuit Depth Reductions | Golovnev, Alexander et al. | 2021 |
| 2 | Minimum Common String Partition: Exact Algorithms | Cygan, Marek et al. | 2021 |
| 3 | Collapsing Superstring Conjecture | Golovnev, Alexander et al. | 2019 |
| 4 | Complexity of Linear Operators | Kulikov, Alexander S. et al. | 2019 |
| 5 | Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates | Kulikov, Alexander S. et al. | 2017 |
| 6 | Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework | Golovnev, Alexander et al. | 2016 |
| 7 | On the Limits of Gate Elimination | Golovnev, Alexander et al. | 2016 |
| 8 | Parameterized Complexity of Secluded Connectivity Problems | Fomin, Fedor V. et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |