Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Cross-scene crowd counting is a challenging task where no laborious data annotation is required for counting people in new target… 
Highly Cited
2009
Highly Cited
2009
Propositional model counting or #SAT is the problem of computing the number of models for a given propositional formula, i.e… 
Highly Cited
2002
Highly Cited
2002
  • J. FlumMartin Grohe
  • 2002
  • Corpus ID: 16585036
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of… 
Highly Cited
2002
Highly Cited
2002
  • S. Vadhan
  • 2002
  • Corpus ID: 18392423
We show that a number of graph-theoretic counting problems remain ${\cal NP}$-hard, indeed $\#{\cal P}$-complete, in very… 
Highly Cited
2000
Highly Cited
2000
AbstractTwo natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those… 
Highly Cited
1989
Highly Cited
1989
A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of… 
Highly Cited
1988
Highly Cited
1988
Rumelhart (1987), has proposed a method for choosing minimal or "simple" representations during learning in Back-propagation… 
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… 
Highly Cited
1979