Dynamic tree isomorphism via first-order updates to a relational database
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 235-243
- https://doi.org/10.1145/275487.275514
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database QueriesJournal of Computer and System Sciences, 1998
- Dyn-FO: A Parallel, Dynamic Complexity ClassJournal of Computer and System Sciences, 1997
- Incremental and Decremental Evaluation of Transitive Closure by First-Order QueriesInformation and Computation, 1995
- Complexity models for incremental computationTheoretical Computer Science, 1994
- Incremental recomputation of active relational expressionsIEEE Transactions on Knowledge and Data Engineering, 1991
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Lower bounds for constant-depth circuits in the presence of help bitsInformation Processing Letters, 1990
- Expressibility and Parallel ComplexitySIAM Journal on Computing, 1989
- Descriptive and computational complexityProceedings of Symposia in Applied Mathematics, 1989
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983