Dyn-FO: A Parallel, Dynamic Complexity Class (Preliminary Version)
Summary: Define Dyn-FO: properties maintainable under single-tuple inserts/deletes/queries by first-order updates, and show surprising upper bounds (graph connectivity, k-edge connectivity, MST, plus approximations for NP optimization) despite static FO impossibility. Introduce bounded-expansion reductions that preserve dynamic classes, separate static vs dynamic completeness (some NL/L-complete problems lose completeness), and show AGAP+ is unlikely in Dyn-FO unless P collapses into parallel linear time. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sushant Patnaik
- 2. Neil Immerman
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,393 | View Maintenance Issues for the Chronicle Data Model (Extended Abstract) | 1995 | PODS | 0.00012223764 |
| 3,959 | Using Witness Generators to Support Bi-directional Update Between Object-Based Databases | 1995 | PODS | 6.5897093e-05 |
| 12,794 | Space-Bounded FOIES | 1995 | PODS | 4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 95 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00050896659 |
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 915 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.0001538509 |
| 581 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019767772 |
| 4,778 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9290535e-05 |
| 1,341 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012486285 |
| 431 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023370207 |
| 12,934 | Complexity of Query Processing in Databases with OR-Objects | 1989 | PODS | 4.1945683e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 12,031 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1945683e-05 |
| 6,239 | The Parameterized Complexity of Database Queries | 2001 | PODS | 5.1417208e-05 |
| 12,727 | Dynamic Tree Isomorphism via First-order Updates to a Relational Database | 1998 | PODS | 4.1945683e-05 |