Asset Details
Do you wish to reserve the book?
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata
Do you wish to request the book?
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata
1998
Overview
Undirected st-connectivity is an important problem in computing. There are algorithms for this problem that use O(n) time and ones that use O(log n) space. The main result of this paper is that, in a very natural structured model, these upper bounds are not simultaneously achievable. Any probabilistic jumping automaton for graphs (JAG) requires either space $\\Omega( \\log^2 n / \\log log n )$ or time $n^{(1 + \\Omega ( 1 / \\log \\log n )) }$ to solve undirected st-connectivity.
Publisher
Society for Industrial and Applied Mathematics
