Bhangale, A., Khot, S., & Minzer, D. (2025). On approximability of Satisfiable k-CSPs: I. Computational Complexity, 34(2). https://doi.org/10.1007/s00037-025-00267-6

BHANGALE, Amey, KHOT, Subhash und MINZER, Dor, 2025. On approximability of Satisfiable k-CSPs: I. computational complexity. 1 Dezember 2025. Vol. 34, no. 2, . DOI 10.1007/s00037-025-00267-6.

Bhangale, A., S. Khot, und D. Minzer. „On Approximability of Satisfiable K-CSPs: I“. Computational Complexity, Bd. 34, Nr. 2, Dezember 2025, https://doi.org/10.1007/s00037-025-00267-6.

Bhangale, Amey/Khot, Subhash/Minzer, Dor: On approximability of Satisfiable k-CSPs: I, computational complexity 2025,

Bhangale, A., Khot, S. und Minzer, D. (2025), „On approximability of Satisfiable k-CSPs: I“, Computational Complexity, Vol. 34 No. 2, verfügbar unter:https://doi.org/10.1007/s00037-025-00267-6.