M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
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
George Markowsky
J. Math. Anal. Appl.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992