www.cs.umass.edu/whesse
by William Hesse, Neil Immerman
http://www.cs.umass.edu/~immerman/pub/completeLICS.ps
Add To MetaCart
Abstract:
www.cs.umass.edu/immerman We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC
Citations
| 193 | Descriptive Complexity – Immerman - 1999 |
| 150 | On uniformity within NC – Barrington, Immerman, et al. |
| 65 | Borel sets and circuit complexity – Sipser - 1983 |
| 54 | View maintenance issues for the chronicle data model – Jagadish, Mumick, et al. - 1995 |
| 41 | Dyn-FO: A parallel dynamic complexity class – Patnaik, Immerman - 1994 |
| 39 | Incremental and Decremental Evaluation of Transitive Closure by Fh-st-Order Queries – Dong, Su - 1992 |
| 38 | Complexity models for incremental computation – Miltersen, Subramanian, et al. - 1994 |
| 6 | On the Power of Incremental Evaluation in SQL-Like Languages – Libkin, Wong - 1999 |
| 4 | The Dynamic Complexity of Transitive Closure is – Hesse - 2003 |
