Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation-Reference-Cited by-同舟云学术

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19
language:
Short-container-title:

Author:

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

Affiliation:

1. PUC & IMFD Chile, Santiago, Chile

2. Carnegie Mellon University, Pittsburgh, PA, USA

Funder

Fondo Nacional de Desarrollo Científico y Tecnológico

Publisher

ACM Press

Reference32 articles.

1. Serge Abiteboul, Gerome Miklau, Julia Stoyanovich, and Gerhard Weikum. 2016. Data, Responsibly (Dagstuhl Seminar 16291). Dagstuhl Reports 6, 7 (2016), 42--71.

2. Alfred V Aho and John E Hopcroft. 1974. The design and analysis of computer algorithms. Pearson Education India.

3. Carme Álvarez and Birgit Jenner. 1993. A very hard log-space counting class. Theoretical Computer Science 107, 1 (1993), 3--30.

4. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2017. A Circuit-Based Approach to Efficient Enumeration. In Proceedings of ICALP. 111:1--111:15.

5. Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019. Constant-Delay Enumeration for Nondeterministic Document Spanners. In Proceedings of ICDT.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Aggregates over Extractions by Regular Expressions;Logical Methods in Computer Science;2023-08-09

2. Weight Annotation in Information Extraction;Logical Methods in Computer Science;2022-01-31

3. The Complexity of Counting Problems Over Incomplete Databases;ACM Transactions on Computational Logic;2021-10-31

4. When is approximate counting for conjunctive queries tractable?;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper);Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15