The Boolean formula value problem is in ALOGTIME (1987)

by Samuel R. Buss
Venue:in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing
Citations:73 - 7 self

Documents Related by Co-Citation

290 Descriptive complexity – N Immerman - 1999
43 An Optimal Parallel Algorithm for Formula Evaluation – S. Buss, S. Cook, A. Gupta, V. Ramachandran - 1992
2564 h~ Design and Analysis of Computer Algorithms – J E Hopcroft, J D Ullman - 1974
514 Finite Model Theory – H-D EBBINHAUS, J FLUM - 1999
510 The complexity of theorem proving procedures – S A Cook - 1971
127 On Uniformity within NCĀ¹ – David A. Mix Barrington, Neil Immerman, Howard Straubing - 1990
215 Bounded-width polynomial-size branching programs recognize exactly those languages – A. Barrington - 1986
779 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
575 Model Theory – Wilfrid Hodges - 2000