Lifting query complexity to time-space complexity for two-way finite automata (Q6141040)
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 7792499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0.8512920141220093
0 references
0.7540804147720337
0 references
0.7412038445472717
0 references
0.7389243245124817
0 references
0.738788366317749
0 references
