A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem

Chen, Y. C. (2010). A Quasi-Fixed Polynomial Problem [doctoral dissertation, Chung Yuan Christian University]. Airiti Library. https://doi.org/10.6840/cycu201000243
黃裕明（2000）。A Neural Solution to Generalized Geometric Programming Problems〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611285152
Kangro, I., Kangro, R., & Vaarmann, O. (2013). Some Approximate Gauss-Newton-type Methods for Nonlinear Ill-Posed Problems. Proceedings of the Estonian Academy of Sciences, 62(4), 227-237. https://doi.org/10.3176/proc.2013.4.03
馮乙庭（2013）。An Algorithm for Finding Terms of a Polynomial〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2013.01005
Babajee, D. K. R., Cordero, A., Soleymani, F., & Torregrosa, J. R. (2012). On a Novel Fourth-Order Algorithm for Solving Systems of Nonlinear Equations. Journal of Applied Mathematics, 2012(), 854-865-055. https://doi.org/10.1155/2012/165452