Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering