Charles A Micchelli
Journal of Approximation Theory
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.
Charles A Micchelli
Journal of Approximation Theory
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON