When is Approximate Counting for Conjunctive Queries Tractable
openalex（2020）
关键词
Conjunctive queries,fully polynomial-time approximation scheme (FPRAS),approximate counting,tree automata
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要
openalex（2020）