Conference paper
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
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
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Matthew A Grayson
Journal of Complexity