F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
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
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
Heng Cao, Haifeng Xi, et al.
WSC 2003