Approximation by Egyptian fractions and the weak greedy algorithm (Q6057050): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On representations by Egyptian fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5788450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underapproximation by Egyptian fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best \(m\)-term approximation and greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:21, 3 August 2024

scientific article; zbMATH DE number 7754814
Language Label Description Also known as
English
Approximation by Egyptian fractions and the weak greedy algorithm
scientific article; zbMATH DE number 7754814

    Statements

    Approximation by Egyptian fractions and the weak greedy algorithm (English)
    0 references
    0 references
    25 October 2023
    0 references
    Egyptian fraction
    0 references
    greedy algorithm
    0 references
    sequences
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references