Counting problem (complexity)

Known as: Counting problem (computatbility theory), Counting class, Counting problem (computability theory) 
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

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?
Highly Cited
2004
Highly Cited
2004
We develop a parameterized complexity theory for counting p roblems. As the basis of this theory, we introduce a hierarchy of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Two natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those that… (More)
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Le thème de cet article est l’étude de problèmes classiques “difficiles” à différents degrés, liés à 3SAT ou concernant des… (More)
  • table 1.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
1997
1997
In this paper we introduce a complexity theoretic notion of counting problems over the real numbers. We follow the approaches of… (More)
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?
Highly Cited
1983
Highly Cited
1983
There are several computational problems that can be formulated as problems of counting the number of objects having a certain… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The objective of this note is to show that the problem of recognizing whether or not two graphs are isomorphic and the problem of… (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?