Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs

von Belova, Tatiana
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)

Computations with Polynomial Evaluation Oracle: Ruling Out Superlinear SETH-Based Lower Bounds

von Belova, Tatiana
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (35. : 2024 : Alexandria, Va.) 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA 2024) ; Volume 3 of 7 (2024)