Directed Planar Reachability Is in Unambiguous Log-Space

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Chris Bourke University of Nebraska--Lincoln
Raghunath Tewari University of Nebraska--Lincoln
N. V. Vinodchandran University of Nebraska--Lincoln
Published in:
Cover Image
 
· Journal
ACM Transactions on Computation Theory (TOCT) TOCT Homepage archive
Volume 1 Issue 1, February 2009
Article No. 4
ACM New York, NY, USA
table of contents doi>10.1145/1490270.1490274
Directed Planar Reachability Is in Unambiguous Log-Space Published by ACM 2009 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 43
· Downloads (cumulative): 395
· Citation Count: 8


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