A simple empirical formula for categorizing computing operations (Q2381324): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4715388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of an algorithm's complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Bootstrap Methods for Reducing the Effects of Contamination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can statistics provide a realistic measure for an algorithm's complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722198 / rank
 
Normal rank

Latest revision as of 15:36, 26 June 2024

scientific article
Language Label Description Also known as
English
A simple empirical formula for categorizing computing operations
scientific article

    Statements

    A simple empirical formula for categorizing computing operations (English)
    0 references
    17 September 2007
    0 references
    Revised differences
    0 references
    \(t\)-test
    0 references
    statistically similar/dissimilar computing operations
    0 references
    parametric bootstrap hypothesis test
    0 references
    Box-Muller transformation
    0 references
    large sample theory
    0 references
    rank based \(t\)-test
    0 references
    philosophy of measurement and tuning
    0 references

    Identifiers