Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms

Abstract The problem of factoring an integer and many other number-theoretic problems can be formulated in terms of binary quadratic Diophantine equations. This class of equations is also significant in complexity theory, subclasses of it having provided most of the natural examples of problems apparently intermediate in difficulty between P and NP -complete problems, as well as NP -complete problems [2, 3, 22, 26]. The theory of integral quadratic forms developed by Gauss gives some of the deepest known insights into the structure of classes of binary quadratic Diophantine equations. This paper establishes explicit polynomial worst-case running time bounds for algorithms to solve certain of the problems in this theory. These include algorithms to do the following: (1) reduce a given integral binary quadratic form; (2) quasi-reduce a given integral ternary quadratic form; (3) produce a form composed of two given integral binary quadratic forms; (4) calculate genus characters of a given integral binary quadratic form, when a complete prime factorization of its determinant D is given as input; (5) produce a form that is the square root under composition of a given form (when it exists), when a complete factorization of D and a quadratic nonresidue for each prime dividing D is given as input.

[1]  G. B. Mathews.  Theory of numbers , 1963 .

[2]  R. Lehman.  Factoring large integers , 1974 .

[3]  Daniel Shanks.  Gauss’s ternary form reduction and the 2-Sylow subgroup , 1971 .

[4]  Gary L. Miller,et al.  On taking roots in finite fields , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  N. Ankeny.  The least quadratic non residue , 1952 .

[6]  Gordon Pall.  Some aspects of Gaussian composition , 1973 .

[7]  Leonard M. Adleman,et al.  Reductions that lie , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Harvey Cohn.  A numerical study of the relative class numbers of real quadratic integral domains , 1962 .

[9]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.

[10]  Jeffrey C. Lagarias,et al.  On the computational complexity of determining the solvability or unsolvability of the equation ²-²=-1 , 1980 .

[11]  Leonard M. Adleman,et al.  Diophantine complexity , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[12]  H. J. S. Smith,et al.  Report on the Theory of Numbers , 1965 .

[13]  Bill Dulin,et al.  Composition of binary quadratic forms over integral domains , 1972 .

[14]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[15]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[16]  Orville Fowler Barcus.  FACTORING LARGE NUMBERS , 1946 .

[17]  D. H. Lehmer,et al.  On factoring large numbers , 1931 .

[18]  Harvey Cohn,et al.  A second course in number theory , 1962 .

[19]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[20]  Leonard M. Adleman,et al.  NP-complete decision problems for quadratic polynomials , 1976, STOC '76.

[21]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[22]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..