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:66 - 7 self

Documents Related by Co-Citation

276 Descriptive Complexity – Neil Immerman - 1999
499 Finite Model Theory – H EBBINGHAUS, J FLUM - 1995
529 The complexity of relational query languages – M Y Vardi
2474 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
751 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
543 Model Theory – Wilfrid Hodges - 2000
1549 Foundations of Databases – S ABITEBOUL, R HULL, V VIANU - 1995
3890 J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn – J E Hopcroft, R Motwani, Ullman - 2001
1504 The Stable Model Semantics For Logic Programming – Michael Gelfond, Vladimir Lifschitz - 1988