Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
Paper
On datalog vs polynomial time
Abstract
We show that certain monotonic polynomial time queries are not expressible in variants of Datalog. The proof techniques include lower bounds for monotone circuit size and a “Pumping Lemma” for Datalog queries. © 1995 by Academic Press, Inc.
Related
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Sankar Basu
Journal of the Franklin Institute
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011