Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
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
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008