Kyaw, K. P. T. (2025). A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP. Zenodo.
Citazione stile Chigago Style (17a edizione)Kyaw, Kyaw Phone Thar. A Polynomial-Time Algorithm for SAT: Constructive Proof That P = NP. Zenodo, 2025.
Citatione MLA (9a ed.)Kyaw, Kyaw Phone Thar. A Polynomial-Time Algorithm for SAT: Constructive Proof That P = NP. Zenodo, 2025.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.