Counting problem

Known as: Counting class, Counting complexity, Counting complexity class 
In computational complexity theory and computability theory, a counting problem is a type of computational problem. If R is a search problem then is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
010203019792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems… (More)
  • figure 3.1
  • figure 4.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
2009
2009
Propositional model counting or #SAT is the problem of computing the number of models for a given propositional formula, i.e… (More)
Is this relevant?
2004
2004
We solve the following counting problem for measure preserving transformations. For f ∈ L+(μ), is it true that sup n Nn(f)(x) n… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
We prove the #P-hardness of the counting problems associated with various satisfiability, graph, and combinatorial problems, when… (More)
  • table 1.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the… (More)
  • figure 1
Is this relevant?
1996
1996
The counting problem requires n asynchronous processes to assign themselves successive values. A solution is linearizable if the… (More)
Is this relevant?
1990
1990
To obtain efficient algorithms for many computational geometry problems, one needs to solve efficiently the range counting… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We develop polynomial time Monte-Carlo algorithms which produce good approximate solutions to enumeration problems for which it… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
where the summation is over the n! permutations of (1,2, . . . , n). It is the same as the determinant except that all the terms… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?