A nearly optimal time-space lower bound for directed st -connectivity on the NNJAG model
Jeff A. Edmonds, Chung Keung Poon · 1995
Article A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model Share on Authors: Jeff Edmonds International Computer Science Institute, Berkeley, California International Computer Science Institute, Berkeley, CaliforniaView Profile , Chung-Keung Poon Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4 Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4View Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 147–156https://doi.org/10.1145/225058.225103Online:29 May 1995Publication History 6citation270DownloadsMetricsTotal Citations6Total Downloads270Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access