New techniques and tighter bounds for local computation algorithms (Q2628795)
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: New techniques and tighter bounds for local computation algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New techniques and tighter bounds for local computation algorithms |
scientific article |
Statements
New techniques and tighter bounds for local computation algorithms (English)
0 references
15 July 2016
0 references
local computation algorithms
0 references
sublinear algorithms
0 references
pseudorandomness
0 references
0 references
0.8600922226905823
0 references
0.8436486124992371
0 references
0.840407133102417
0 references
0.8197290897369385
0 references
0.7973024249076843
0 references
