Author:
Durand Arnaud,Mengel Stefan
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference39 articles.
1. Arithmetization: A new method in structural complexity theory;Babai;Computational Complexity,1991
2. On acyclic conjunctive queries and constant delay enumeration;Bagan,2007
3. M. Bauland, P. Chapdelaine, N. Creignou, M. Hermann, H. Vollmer, An algebraic approach to the complexity of generalized conjunctive queries, in: Seventh International Conference on Theory and Applications of Satisfiability Testing, SATʼ04, Vancouver, BC, Canada, 2004.
4. Modern Graph Theory;Bollobas,1998
5. Complexity issues in counting, polynomial evaluation and zero finding;Briquel,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tractable Circuits in Database Theory;ACM SIGMOD Record;2024-07-30
2. Answer Counting under Guarded TGDs;Logical Methods in Computer Science;2023-09-14
3. Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29
4. Constant Delay Enumeration for Conjunctive Queries;ACM SIGMOD Record;2015-05-21
5. The Arithmetic Complexity of Tensor Contraction;Theory of Computing Systems;2015-04-14