scientific article; zbMATH DE number 4173143
From MaRDI portal
Recommendations
- Algorithms in Algebraic Number Theory
- Some remarks concerning the complexity of computing class groups of quadratic fields
- scientific article; zbMATH DE number 4137898
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- On the Computation of the Class Number of an Algebraic Number Field
Cited in
(17)- Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series
- The complexity of computing all subfields of an algebraic number field
- On the complexity of algebraic numbers
- Kummer theory for number fields via entanglement groups
- Algorithmic aspects of Suslin's proof of Serre's conjecture
- scientific article; zbMATH DE number 3119358 (Why is no real title available?)
- scientific article; zbMATH DE number 7295748 (Why is no real title available?)
- scientific article; zbMATH DE number 4137898 (Why is no real title available?)
- scientific article; zbMATH DE number 4144078 (Why is no real title available?)
- scientific article; zbMATH DE number 3961588 (Why is no real title available?)
- scientific article; zbMATH DE number 4077311 (Why is no real title available?)
- Algorithms in Algebraic Number Theory
- scientific article; zbMATH DE number 953031 (Why is no real title available?)
- scientific article; zbMATH DE number 7150624 (Why is no real title available?)
- Integer complexity: algorithms and computational results
- Factoring polynomials over finite fields: A survey
- The complexity of almost linear diophantine problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197949)