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
ISO-690 (author-date, English)BHANGALE, Amey, KHOT, Subhash and MINZER, Dor, 2025. On approximability of Satisfiable k-CSPs: I. computational complexity. 1 December 2025. Vol. 34, no. 2, . DOI 10.1007/s00037-025-00267-6.
Modern Language Association 9th editionBhangale, A., S. Khot, and D. Minzer. “On Approximability of Satisfiable K-CSPs: I”. Computational Complexity, vol. 34, no. 2, Dec. 2025, https://doi.org/10.1007/s00037-025-00267-6.
Mohr Siebeck - Recht (Deutsch - Österreich)Bhangale, Amey/Khot, Subhash/Minzer, Dor: On approximability of Satisfiable k-CSPs: I, computational complexity 2025,
Emerald - HarvardBhangale, A., Khot, S. and Minzer, D. (2025), “On approximability of Satisfiable k-CSPs: I”, Computational Complexity, Vol. 34 No. 2, available at:https://doi.org/10.1007/s00037-025-00267-6.