Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata (Q4210119)
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: Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata |
scientific article; zbMATH DE number 1200761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata |
scientific article; zbMATH DE number 1200761 |
Statements
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata (English)
0 references
21 September 1998
0 references
time-space tradeoffs
0 references
lower bounds
0 references
JAG graph
0 references
undirected st-connectivity
0 references
0.8941072821617126
0 references
0.8622480630874634
0 references
0.8440958857536316
0 references
