Deterministic vs non-deterministic graph property testing (Q480810): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing versus Estimation of Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing. Current research and surveys / 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: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Deterministic Graph Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing properties of graphs and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Revision as of 10:14, 9 July 2024

scientific article
Language Label Description Also known as
English
Deterministic vs non-deterministic graph property testing
scientific article

    Statements

    Identifiers