Sciweavers

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

12

FOCS
1997
IEEE

favoriteEmaildiscussreport

116views Theoretical Computer Science» more FOCS 1997»

Making Nondeterminism Unambiguous

13 years 8 months ago

Making Nondeterminism Unambiguous

Download ftp.cs.rutgers.edu

We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly = UL/poly LogCFL/poly = UAuxPDA(log n, nO(1) )/poly

Klaus Reinhardt, Eric Allender

Real-time Traffic

Complexity Classes | FOCS 1997 | Nondeterministic Logarithmic Space | Nonuniform Complexity | Theoretical Computer Science |

claim paper

Related Content

» Directed Planar Reachability is in Unambiguous LogSpace

» Relaxed Determinism Making Redundant Execution on Multiprocessors Practical

» The Role of Ontologies for an Effective and Unambiguous Dissemination of Clinical Guidelin...

» Formal Analysis of Nondeterminism in Verilog Cell Library Simulation Models

» Alleviating Priority Inversion and NonDeterminism in RealTime CORBA ORB Core Architectures

» Reducing performance nondeterminism via cacheaware page allocation strategies

» Programming with angelic nondeterminism

» Practical Considerations in Making CORBA Services FaultTolerant

» Making prophecies with decision predicates

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	FOCS
Authors	Klaus Reinhardt, Eric Allender

Comments (0)