Lagarias, J. C. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. (English) Zbl 0473.68030 J. Algorithms 1, 142-186 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 20 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 11D09 Quadratic and bilinear Diophantine equations 11A63 Radix representation; digital problems Keywords:binary quadratic Diophantine equations; polynomial worst-case running time bounds PDF BibTeX XML Cite \textit{J. C. Lagarias}, J. Algorithms 1, 142--186 (1980; Zbl 0473.68030) Full Text: DOI OpenURL