#P-complete counting problems

István Miklós

Type: Book-Chapter

Publication Date: 2019-02-21

Citations: 0

DOI: https://doi.org/10.1201/b22024-4

Similar Works

Action	Title	Year	Authors
+	Counting Problems	2003	Vijay V. Vazirani
+	A List of P-Complete Problems	1989	Satoru Miyano Shuji Shiraishi Takayoshi Shoudai
+	The complexity of counting problems	2001	Dominic Welsh Amy Gale
+	Complexity dichotomies of counting problems	2012	Lizhen Ji Yat Sun Poon Lo Yang Shing‐Tung Yau
+	Counting Complexity	1997	Lance Fortnow
+	How Many Needles are in a Haystack, or How to Solve #P-Complete Counting Problems Fast	2006	Reuven Y. Rubinstein
+	Kolmogorov complexity of #P functions	1991	Frederic Green Jacobo Torán Romero
+	46 BQP-Complete Problems	2012	Shengyu Zhang
+	Approximable counting and sampling problems	2019	István Miklós
+	#P-complete problems and linear representations (Representation theory and related combinatorics)	2016	伯元松木
+	Counting trees in a graph is #P-complete	1994	Mark Jerrum
+	Counting Processes	1986
+	Counting Functions	2025	Burglind Jöricke
+	A New Series of Δp2 - Complete Problems	1989	Miyano Satoru
+	Subtractive reductions and complete problems for counting complexity classes	2005	Arnaud Durand Miki Hermann Phokion G. Kolaitis
+	Complexity of $${\mathcal {P}}$$ Functions	2021	George Tourlakis
+	Exact Enumerations	2009	I. G. Enting Iwan Jensen
+	O# and the p-point problem	1978	A. R. D. Mathias
+	Enumerative Combinatorics, Algorithms and Physics	2004	Xavier Gérard Viennot
+	Polynomially Solvable Problems	1994	V. S. Tanaev Valery Gordon Yakov M. Shafransky

Action	Title	Year	Authors

Action	Title	Year	Authors