Separating sublinear time computations by approximate diameter (Q849140): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Geometric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Spanning Tree Weight in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the weight of metric minimum spanning trees in sublinear-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time width-bounded separators and their application to the protein side-chain packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Testing Expansion in Bounded-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Average Parameters of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161525 / rank
 
Normal rank

Latest revision as of 12:20, 2 July 2024

scientific article
Language Label Description Also known as
English
Separating sublinear time computations by approximate diameter
scientific article

    Statements

    Separating sublinear time computations by approximate diameter (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    0 references
    sublinear time algorithm
    0 references
    diameter
    0 references
    randomization
    0 references
    separation of complexity classes
    0 references
    0 references