Constructive root bound for \(k\)-ary rational input numbers (Q861279): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A strong and easily computable separation bound for arithmetic expressions involving radicals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5797046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Close Enough is Close Enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5718722 / rank
 
Normal rank

Revision as of 11:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Constructive root bound for \(k\)-ary rational input numbers
scientific article

    Statements

    Constructive root bound for \(k\)-ary rational input numbers (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    constructive root bounds
    0 references
    exact geometric computation
    0 references
    robust numerical algorithms
    0 references
    \(k\)-ary rational numbers
    0 references

    Identifiers