SIGN IN
SIGN UP
Undirected ST-connectivity in log-space
Full Text:
PDF
Buy this Article
Author:
Omer Reingold
Weizmann Institute of Science, Rehovot, Israel
Published in:
· Proceeding
STOC '05
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pages 376-385
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-960-8
doi>
10.1145/1060590.1060647
2005 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 47
· Downloads (cumulative): 1,188
· Citation Count: 87
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
complexity measures and classes
general
theory
tradeoffs among complexity measures
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder