Dyn-FO: A Parallel, Dynamic Complexity Class (1994)

Cached

Download Links

by Sushant Patnaik , Neil Immerman
Venue:Journal of Computer and System Sciences
Citations:50 - 4 self

Active Bibliography

The Computational Complexity Column – Eric Allender Rutgers, Eric Allender, Jack H. Lutz, Elvira Mayordomo - 1998
14 Dynamic Tree Isomorphism via First-order Updates to a Relational Database – Kousha Etessami
30 Circuit Complexity before the Dawn of the New Millennium – Eric Allender - 1997
20 Finite-Model Theory - A Personal Perspective – Ronald Fagin - 1993
1 Dynamic Definability – Erich Grädel, Sebastian Siebertz - 2012
21 Nonrecursive Incremental Evaluation of Datalog Queries – Guozhu Dong, Jianwen Su, Rodney Topor - 1995
274 Maintenance of Materialized Views: Problems, Techniques, and Applications – Ashish Gupta, Inderpal Singh Mumick - 1995
2 Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink – Thore Husfeldt - 1994
16 Time, Hardware, and Uniformity – David Mix Barrington, Neil Immerman - 1997
11 Oracles and Quantifiers – J.A. Makowsky, Y.B. Pnueli - 1994
3 Fixed-Point Logics, Descriptive Complexity, And Random Satisfiability – Albert Atserias - 2002
2 Complexity Classes – Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
12 DSPACE[n^k] = VAR[k+1] – Neil Immerman - 1991
1 Number of Variables Is Equivalent To Space – Neil Immerman, Jonathan F. Buss, David A. Mix Barrington - 1999
57 Describing Graphs: a First-Order Approach to Graph Canonization – Neil Immerman , Eric Lander - 1990
47 Descriptive and Computational Complexity – Neil Immerman - 1989
51 Counting Quantifiers, Successor Relations, and Logarithmic Space – Kousha Etessami
On Circuit Complexity Classes and Iterated Matrix Multiplication – Fengming Wang - 2012
24 A First-Order Isomorphism Theorem – Eric Allender, Jose Balcázar, Neil Immerman - 1993