Subtractive reductions and complete problems for counting complexity classes-Reference-Cited by-同舟云学术

Subtractive reductions and complete problems for counting complexity classes

Published:2005-08 Issue:3 Volume:340 Page:496-513
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Durand Arnaud,Hermann Miki,Kolaitis Phokion G.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. The complexity of model checking for circumscriptive formulae;Cadoli;Inform. Process. Lett.,1992

2. Is #P closed under subtraction?;Hemachandra;Bull. Eur. Assoc. Theoret. Comput. Sci.,1992

3. The satanic notations: counting classes beyond #P and other definitional adventures;Hemaspaandra;SIGACT News,1995

4. M. Hermann, L. Juban, P.G. Kolaitis, On the complexity of counting the Hilbert basis of a linear Diophantine system, in: H. Ganzinger, D. McAllester, A. Voronkov (Eds.), Proc. 6th Internat. Conf. on Logic for Programming and Automated Reasoning (LPAR’99), Tbilisi (Republic of Georgia), Lecture Notes in Computer Science (in Artificial Intelligence), Vol. 1705, Springer, Berlin, September 1999, pp. 13–32.

5. Descriptive Complexity;Immerman,1999

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

1. A Scalable t-Wise Coverage Estimator: Algorithms and Applications;IEEE Transactions on Software Engineering;2024-08

2. Parameterised Counting in Logspace;Algorithmica;2023-04-21

3. Solving Projected Model Counting by Utilizing Treewidth and its Limits;Artificial Intelligence;2023-01

4. A scalable t-wise coverage estimator;Proceedings of the 44th International Conference on Software Engineering;2022-05-21

5. Descriptive complexity of #P functions: A new perspective;Journal of Computer and System Sciences;2021-03