On Datalog vs. polynomial time
Journal of Computer and System Sciences(1995)
摘要
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.
更多查看译文
关键词
lower bound,polynomial time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要