Deterministic vs non-deterministic graph property testing (Q480810): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11856-014-1096-x / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6379545 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Szemerédi's regularity lemma | |||
Property / zbMATH Keywords: Szemerédi's regularity lemma / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nondeterministic testing of graph | |||
Property / zbMATH Keywords: nondeterministic testing of graph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2155726088 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1304.1982 / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1007/S11856-014-1096-X / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:49, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deterministic vs non-deterministic graph property testing |
scientific article |
Statements
Deterministic vs non-deterministic graph property testing (English)
0 references
11 December 2014
0 references
Szemerédi's regularity lemma
0 references
nondeterministic testing of graph
0 references
0 references