This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality type. It extends one of Bellmore and Ratliff for linear set-covering ...

Jöran Friberg, Geometric division problems, quadratic equations, and recursive geometric algorithms in Mesopotamian mathematics, Archive for History of Exact Sciences, Vol. 68, No. 1 (January 2014), ...

The quadratic formula learned by generations of math students is difficult to remember, but it can be used to solve quadratic equations where y = 0.