Deterministic vs non-deterministic graph property testing (Q480810)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deterministic vs non-deterministic graph property testing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9125949740409852
0 references
0.8290475606918335
0 references
0.8255515098571777
0 references
0.8220720887184143
0 references
0.8166937232017517
0 references
