A Polynomial Time Complexity Bound for Computations on Curves (Q4210172): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation to certain transcendental decimal fractions by algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eisenstein's theorem on power series expansions of algebraic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of the Resolution of Plane Curve Singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative version of Runge's theorem on diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility testing over local fields / rank
 
Normal rank

Latest revision as of 16:11, 28 May 2024

scientific article; zbMATH DE number 1200811
Language Label Description Also known as
English
A Polynomial Time Complexity Bound for Computations on Curves
scientific article; zbMATH DE number 1200811

    Statements