A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jeff Edmonds International Computer Science Institute, Berkeley, California
Chung-Keung Poon Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4
Published in:
Cover Image
 
· Proceeding
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Pages 147-156
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-718-9 doi>10.1145/225058.225103
A nearly optimal time-space lower bound for directed <italic>st</italic>-connectivity on the NNJAG model Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 9
· Downloads (cumulative): 199
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder