Some remarks concerning the complexity of computing class groups of quadratic fields (Q1179460)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 24659
Language Label Description Also known as
default for all languages
No label defined
    English
    Some remarks concerning the complexity of computing class groups of quadratic fields
    scientific article; zbMATH DE number 24659

      Statements

      Some remarks concerning the complexity of computing class groups of quadratic fields (English)
      0 references
      0 references
      0 references
      26 June 1992
      0 references
      The authors obtain several results concerning the complexity of computations in quadratic number fields \(F\). Under the assumption of the generalized Riemann hypothesis they prove among other things that the following problems are in \(NP\cap \hbox{co-}NP\) for every order \(\mathcal O\) of \(F\): (i) Is a given ideal \(A\) of \(\mathcal O\) principal? (ii) Do given ideals \(A_ 1,\dots,A_ k\) of \(\mathcal O\) generate the class group?
      0 references
      class group computations
      0 references
      complexity
      0 references
      quadratic number fields
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references