Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
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
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Conference paper
Characterization of a next generation step-and-scan system
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications