The Complexity of Solving Polynomial Equations by Prime Root Extractions (Q4748234): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0604010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072538628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Solving Polynomial Equations by Quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5825754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5830710 / rank
 
Normal rank

Latest revision as of 18:32, 13 June 2024

scientific article; zbMATH DE number 3803570
Language Label Description Also known as
English
The Complexity of Solving Polynomial Equations by Prime Root Extractions
scientific article; zbMATH DE number 3803570

    Statements

    The Complexity of Solving Polynomial Equations by Prime Root Extractions (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    lower bounds
    0 references
    polynomial equations
    0 references
    binomial equations
    0 references
    solvable by radicals
    0 references
    inverse Galois theory
    0 references
    cyclotomic polynomials
    0 references
    0 references