Timeline for Complexity class of efficient streaming algorithms
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2020 at 2:04 | comment | added | Caleb Stanford | Thank you for the answer. Indeed, the class is called $1L$ and is studied by Hartmanis and others, e.g. Hartmanis and Mahaney, 1981: Languages simultaneously complete for one-way and two-way log-tape automata. Here is a related question. | |
| Apr 25, 2020 at 0:48 | vote | accept | Caleb Stanford | ||
| Apr 24, 2020 at 22:38 | history | answered | Ryan Williams | CC BY-SA 4.0 |