Incremental delay enumeration: Space and time-Reference-Cited by-同舟云学术

Incremental delay enumeration: Space and time

Published:2019-09 Issue: Volume:268 Page:179-190
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Capelli Florent,Strozecki Yann

Funder

French Agence Nationale de la Recherche

ESPRC

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference34 articles.

1. Amir Abboud, Thoma Dueholm Hansen, Virgini Vassilevska Williams, Ryan Williams, Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made, in: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 375–388, 2016.

2. Reverse search for enumeration;Avis;Discrete Appl. Math.,1996

3. Algorithms and Complexity of Enumeration Problems for the Evaluation of Logical Queries;Bagan,2009

4. Efficient generation of stable planar cages for chemistry;Barth,2015

5. De la Pertinence de l’énumération: Complexité en logiques propositionnelle et du premier ordre;Brault-Baron,2013

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

1. Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration;ACM Transactions on Database Systems;2022-08-18

2. Efficiently enumerating hitting sets of hypergraphs arising in data profiling;Journal of Computer and System Sciences;2022-03

3. The complexity of dependency detection and discovery in relational databases;Theoretical Computer Science;2022-01

4. On the Enumeration Complexity of Unions of Conjunctive Queries;ACM Transactions on Database Systems;2021-06-30

5. Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29