Testing Graph Blow-Up (Q5894229): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the testable graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for sampling algorithms for estimating the average / 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: Hierarchy Theorems for Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proximity oblivious testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank

Latest revision as of 10:25, 4 July 2024

scientific article; zbMATH DE number 5940586
Language Label Description Also known as
English
Testing Graph Blow-Up
scientific article; zbMATH DE number 5940586

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references