When is approximate counting for conjunctive queries tractable?

DOI10.1145/3406325.3451014arXiv2005.10029OpenAlexW3169968423MaRDI QIDQ6065228

Marcelo Arenas, Cristian Riveros, Luis Alberto Croquevielle, Rajesh Jayaram

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.10029

zbMATH Keywords

tree automataapproximate countingconjunctive queriesfully polynomial-time approximation scheme (FPRAS)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: When is approximate counting for conjunctive queries tractable?