From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT

von Chen, Zongchen
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7 (2023)

Enumerating k-SAT Functions

von Dong, Dingding
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 3 of 5 (2022)

Lower Bounds for Max-Cut via Semidefinite Programming

von Carlson, Charles
Veröffentlicht in LATIN (14. : 2020 : Online) LATIN 2020: theoretical informatics (2020)