Average-case analysis of algorithms using Kolmogorov complexity (Q1587331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Using Networks of Queues and Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the average-case complexity of shellsort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive ergodic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational problem for random Young tableaux / rank
 
Normal rank

Latest revision as of 08:55, 3 June 2024

scientific article
Language Label Description Also known as
English
Average-case analysis of algorithms using Kolmogorov complexity
scientific article

    Statements

    Average-case analysis of algorithms using Kolmogorov complexity (English)
    0 references
    0 references
    0 references
    0 references
    2000
    0 references
    average-case complexity of algorithms
    0 references
    Kolmogorov complexity
    0 references

    Identifiers