On datalog vs polynomial time
From MaRDI portal
Publication:1900923
DOI10.1006/jcss.1995.1060zbMath0831.68015OpenAlexW1984280364MaRDI QIDQ1900923
Mihalis Yannakakis, Stavros S. Cosmandakis, Foto N. Afrati
Publication date: 25 October 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1060
Related Items (7)
A datalog-based computational model for coordination-free, data-parallel systems ⋮ Bounds in ontology-based data access via circuit complexity ⋮ Modern Datalog Engines ⋮ Preservation theorems in finite model theory ⋮ Computing with infinitary logic ⋮ Inherent complexity of recursive queries ⋮ The expressiveness of DAC
Uses Software
This page was built for publication: On datalog vs polynomial time
