Realizable paths and the NL vs L problem
A celebrated theorem of Savitch [Savitch'70] states that NSPACE(S) is contained in DSPACE(S²). In particular, Savitch gave a deterministic algorithm to solve ST-Connectivity (an NL-complete problem) using O({log}²{n}) space, implying NL (non-deterministic logspace) is contained in DSPACE({log}²...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/42770 |