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