Lifting query complexity to time-space complexity for two-way finite automata (Q6141040): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:34, 10 July 2024
scientific article; zbMATH DE number 7792499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lifting query complexity to time-space complexity for two-way finite automata |
scientific article; zbMATH DE number 7792499 |
Statements
Lifting query complexity to time-space complexity for two-way finite automata (English)
0 references
22 January 2024
0 references
quantum computing
0 references
time-space complexity
0 references
two-way finite automata
0 references
communication complexity
0 references
lifting theorems
0 references
query algorithms
0 references
