The Boolean formula value problem is in ALOGTIME (1987)
Cached
Download Links
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- [www.math.ucsd.edu]
- [math.ucsd.edu]
- DBLP
Other Repositories/Bibliography
by
Samuel R. Buss
| Venue: | in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing |
| Citations: | 55 - 7 self |
BibTeX
@INPROCEEDINGS{Buss87theboolean,
author = {Samuel R. Buss},
title = {The Boolean formula value problem is in ALOGTIME},
booktitle = {in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing},
year = {1987},
pages = {123--131}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 AC reductions.
