Complete problems in the counting hierarchy - DROPS - Schloss ...

Hervé Fournier, Guillaume Malod, and Stefan Mengel 373
17 P. Koiran and S. Perifel. The complexity of two problems on arithmetic circuits. Theor.
Comput. Sci., 389(1-2):172–181, 2007.
18 P. Koiran and S. Perifel. Interpolation in Valiant’s Theory. Computational Complexity,
pages 1–20, 2011.
19 I. Koutis. Faster Algebraic Algorithms for Path and Packing Problems. In ICALP, pages
575–586, 2008.
20 J. H. P. Kwisthout, H. L. Bodlaender, and L. C. Van Der Gaag. The complexity of finding
kth most probable explanations in probabilistic networks. In Proceedings of the 37th
international conference on Current trends in theory and practice of computer science, SOF-
SEM’11, pages 356–367, Berlin, Heidelberg, 2011. Springer-Verlag.
21 M. Mahajan and V. Vinay. A combinatorial algorithm for the determinant. In Proceedings
of the eighth annual ACM-SIAM symposium on Discrete algorithms, pages 730–738. Society
for Industrial and Applied Mathematics, 1997.
22 G. Malod. The Complexity of Polynomials and Their Coefficient Functions. In IEEE
Conference on Computational Complexity, pages 193–204, 2007.
23 G. Malod and N. Portier. Characterizing Valiant’s algebraic complexity classes. J. Complexity,
24(1):16–38, 2008.
24 M. Mundhenk, J. Goldsmith, C. Lusena, and E. Allender. Complexity of Finite-Horizon
Markov Decision Process Problems. Journal of the ACM (JACM), 47(4):681–720, 2000.
25 A. Schönhage. On the Power of Random Access Machines. In ICALP, pages 520–529, 1979.
26 Y. Strozecki. Enumeration complexity and matroid decomposition. PhD thesis, Université
Paris Diderot - Paris 7, 2010.
27 J. Torán. Succinct Representations of Counting Problems. In AAECC, pages 415–426,
1988.
28 J. Torán. Complexity Classes Defined by Counting Quantifiers. J. ACM, 38(3):753–774,
1991.
29 L.G. Valiant. Completeness classes in algebra. In Proceedings of the eleventh annual ACM
symposium on Theory of computing, pages 249–261. ACM, 1979.
30 H. Venkateswaran and M. Tompa. A New Pebble Game that Characterizes Parallel Complexity
Classes. SIAM J. Comput., 18(3):533–549, 1989.
31 J. Von Zur Gathen. Feasible arithmetic computations: Valiant’s hypothesis. Journal of
Symbolic Computation, 4(2):137–172, 1987.
32 K. W. Wagner. The Complexity of Combinatorial Problems with Succinct Input Representation.
Acta Informatica, 23(3):325–356, 1986.
33 R. Williams. Finding paths of length k in O ∗ (2 k ) time. Information Processing Letters,
109(6):315–318, 2009.
S TAC S ’ 1 2