Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099)
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: Lower bounds and hardness magnification for sublinear-time shrinking cellular automata |
scientific article; zbMATH DE number 7493538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds and hardness magnification for sublinear-time shrinking cellular automata |
scientific article; zbMATH DE number 7493538 |
Statements
Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (English)
0 references
21 March 2022
0 references
cellular automata
0 references
hardness magnification
0 references
minimum circuit size problem
0 references
streaming algorithms
0 references
sublinear-time computation
0 references
0 references
0.83030033
0 references
0.8289621
0 references
0.82772934
0 references
0 references
0.8234322
0 references
0.8234322
0 references
0.82319397
0 references
