Reduction of Indefinite Forms

  • Johannes Buchmann
  • Ulrich Vollmer
Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 20)

Abstract

In this chapter we explain reduction theory for indefinite forms which is quite different from reduction theory for positive definite forms. Reduced indefinite forms can only be used to decide equivalence of integral indefinite forms and the decision algorithm is much less efficient than in the positive definite case since reduction is no longer unique. Reduction theory also solves the minimum problem for integral indefinite forms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  • Johannes Buchmann
    • 1
  • Ulrich Vollmer
    • 1
  1. 1.Department of Computer ScienceTechnical UniversityDarmstadtGermany

Personalised recommendations