The complexity of computing all subfields of an algebraic number field (Q1733310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4714011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relative van Hoeij algorithm over number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meet and join within the lattice of set partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Functions, m-Sets, and Galois Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp estimates for triangular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing congruences efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Systems of a Galois Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing subfields. A detailed description of the algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradual sub-lattice reduction and a new complexity for factoring polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphisms of algebraic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating subfields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank

Revision as of 20:01, 18 July 2024

scientific article
Language Label Description Also known as
English
The complexity of computing all subfields of an algebraic number field
scientific article

    Statements

    The complexity of computing all subfields of an algebraic number field (English)
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    subfields
    0 references
    lattice
    0 references
    partitions
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references