Sciweavers

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

14

STOC
1987
ACM

favoriteEmaildiscussreport

104views Algorithms» more STOC 1987»

The Boolean Formula Value Problem Is in ALOGTIME

13 years 8 months ago

The Boolean Formula Value Problem Is in ALOGTIME

Download euclid.ucsd.edu

The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value problem is complete for alternating log time under deterministic log time reductions. Consequently, it is also complete for alternating log time under AC0 reductions.

Samuel R. Buss

Real-time Traffic

Algorithms | Boolean Formula | Boolean Formula Value | Log Time | STOC 1987 |

claim paper

Related Content

» A Note on Satisfying TruthValue Assignments of Boolean Formulas

» Computing the Density of States of Boolean Formulas

» ModelIndependent Bounding of the Supports of Boolean Formulae in Binary Data

» Towards Solving ManyValued MaxSAT

» Encoding Quantified CSPs as Quantified Boolean Formulae

» Randomized vsDeterministic Decision Tree Complexity for ReadOnce Boolean Functions

» A fuzzified BRAIN algorithm for learning DNF from incomplete data

» Survey propagation an algorithm for satisfiability

» Computational Complexity of Constraint Satisfaction

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	STOC
Authors	Samuel R. Buss

Comments (0)