Matthew A Grayson
Journal of Complexity
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
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics