Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models

Barnes, Greg; Edmonds, Jeff A.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models

MPS-Authors

/persons/resource/persons295561

Barnes, Greg
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Barnes, G., & Edmonds, J. A. (1998). Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM Journal on Computing, 27(4), 1190-1202.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-37FC-C

Abstract

There is no abstract available