White-box vs. black-box complexity of search problems: Ramsey and graph property testing (Q5215463)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7165886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | White-box vs. black-box complexity of search problems: Ramsey and graph property testing |
scientific article; zbMATH DE number 7165886 |
Statements
White-Box vs. Black-Box Complexity of Search Problems (English)
0 references
11 February 2020
0 references
Ramsey theory
0 references
black-box hardness
0 references
white-box hardness
0 references
0.7092491984367371
0 references
0.6979021430015564
0 references
0.6892861723899841
0 references
