ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Computations with finitely generated modules over Dedekind rings
Full text PdfPdf (459 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents
Bonn, West Germany
Pages: 151 - 156  
Year of Publication: 1991
ISBN:0-89791-437-6
Authors
Wieb Bosma  Department of Pure Mathematics, University of Sydney, Sydney, NSW 2006, Australia
Michael Pohst  Mathematisches Institut, Heinrich-Heine-Universität, 4000 Düsseldorf, Germany
Sponsors
GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 12,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120714
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H.W. Lenstr~, jr., M.E. Pohst, Computational algebraic number theory, Birkh~user, to appear 1991.
 
2
O.T. O'Mear~, Introduction to quadratic forms, Berlin: Springer, 1963.
 
3
M. Pohst , H. Zassenhaus, Algorithmic algebraic number theory, Cambridge University Press, New York, NY, 1989
 
4
J. Gr~f yon Schmettow, KANT- ~ toot for computations in ~Igebr~ic number fields, in: A. PethS, M.E. Pohst, H.C. Williams, H. (3. Zimmer (eds.), Computational Number Theory, W~lter de Gruyter 1991.

CITED BY
M. Daberkow , M. Pohst, Computations with relative extensions of number fields with an application to the construction of Hilbert class fields, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.68-76, July 10-12, 1995, Montreal, Quebec, Canada

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Number-theoretic computations (e.g., factoring, primality testing)

Additional Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.2 Algorithms
          Subjects: Algebraic algorithms


General Terms:
Algorithms, Theory, Verification

Collaborative Colleagues:
Wieb Bosma: colleagues
Michael Pohst: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player