APA (7th ed.) Citation

Kyaw, K. P. T. (2025). A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP. Zenodo.

Chicago Style (17th ed.) Citation

Kyaw, Kyaw Phone Thar. A Polynomial-Time Algorithm for SAT: Constructive Proof That P = NP. Zenodo, 2025.

MLA (9th ed.) Citation

Kyaw, Kyaw Phone Thar. A Polynomial-Time Algorithm for SAT: Constructive Proof That P = NP. Zenodo, 2025.

Warning: These citations may not always be 100% accurate.