Chai Wah Wu
Linear Algebra and Its Applications
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
Heng Cao, Haifeng Xi, et al.
WSC 2003
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Imran Nasim, Michael E. Henderson
Mathematics