Deterministic FOIES are strictly weaker
Annals of Mathematics and Artificial Intelligence
The Dynamic Complexity of Transitive Closure Is In DynTC0
ICDT '01 Proceedings of the 8th International Conference on Database Theory
On the Power of Incremental Evaluation in SQL-Like Languages
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
The dynamic complexity of transitive closure is in DynTC0
Theoretical Computer Science - Database theory
| Hi-index | 0.00 |