Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

68

Voted

CORR
2010
Springer

52views Education» more CORR 2010»

On the Power of Unambiguity in Logspace

15 years 3 months ago

On the Power of Unambiguity in Logspace

Download www.cse.unl.edu

Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» The Isomorphism Problem for Planar 3Connected Graphs is in Unambiguous Logspace

» Directed Planar Reachability is in Unambiguous LogSpace

» Reachability in K3 3Free Graphs and K5Free Graphs Is in Unambiguous LogSpace

» Longest paths in Planar DAGs in Unambiguous Logspace

» A LogSpace Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

» On the Power of Unambiguity in Alternating Machines

» Type Inference for Sublinear Space Functional Programming

» Logspace Versions of the Theorems of Bodlaender and Courcelle

» Symmetric Datalog and Constraint Satisfaction Problems in Logspace

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran

Comments (0)