English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Barnes, Greg1, Author
Edmonds, Jeff A., Author
Affiliations:
1Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021998
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 518007
Other: Local-ID: C1256428004B93B8-0BB7C006D332F325C1256744005CB4D2-BarnesEdmondsSIAMJCOMPUT1998
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 27 (4) Sequence Number: - Start / End Page: 1190 - 1202 Identifier: ISSN: 0097-5397