Brake, Danielle A., Daleo, Noah S., Hauenstein, Jonathan D., and Sherman, Samantha N. Solving Critical Point Conditions for the Hamming and Taxicab Distances to Solution Sets of Polynomial Equations. Retrieved from https://par.nsf.gov/biblio/10195949. 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) . Web. doi:10.1109/SYNASC49474.2019.00017.

Brake, Danielle A., Daleo, Noah S., Hauenstein, Jonathan D., & Sherman, Samantha N. Solving Critical Point Conditions for the Hamming and Taxicab Distances to Solution Sets of Polynomial Equations. 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), (). Retrieved from https://par.nsf.gov/biblio/10195949. https://doi.org/10.1109/SYNASC49474.2019.00017

Brake, Danielle A., Daleo, Noah S., Hauenstein, Jonathan D., and Sherman, Samantha N. "Solving Critical Point Conditions for the Hamming and Taxicab Distances to Solution Sets of Polynomial Equations". 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) (). Country unknown/Code not available. https://doi.org/10.1109/SYNASC49474.2019.00017. https://par.nsf.gov/biblio/10195949.

@article{osti_10195949,
place = {Country unknown/Code not available}, title = {Solving Critical Point Conditions for the Hamming and Taxicab Distances to Solution Sets of Polynomial Equations}, url = {https://par.nsf.gov/biblio/10195949}, DOI = {10.1109/SYNASC49474.2019.00017}, abstractNote = {}, journal = {2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)}, author = {Brake, Danielle A. and Daleo, Noah S. and Hauenstein, Jonathan D. and Sherman, Samantha N.}, }