W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
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
Sankar Basu
Journal of the Franklin Institute
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Conference paper
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002