Rele, R., & Nedich, A. (2026). A Certificate of Unboundedness for Polynomial Optimization Problems.
Style de citation Chicago (17e éd.)Rele, Rohan, et Angelia Nedich. A Certificate of Unboundedness for Polynomial Optimization Problems. 2026.
Style de citation MLA (9e éd.)Rele, Rohan, et Angelia Nedich. A Certificate of Unboundedness for Polynomial Optimization Problems. 2026.
Attention : ces citations peuvent ne pas être correctes à 100%.