Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,463,879 papers from all fields of science
Search
Sign In
Create Free Account
Counting problem (complexity)
Known as:
Counting problem (computatbility theory)
, Counting class
, Counting problem (computability theory)
Expand
In computational complexity theory and computability theory, a counting problem is a type of computational problem. If R is a search problem then is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
2-satisfiability
Complexity class
Computability theory
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Cross-scene crowd counting via deep convolutional neural networks
Cong Zhang
,
Hongsheng Li
,
Xiaogang Wang
,
Xiaokang Yang
Computer Vision and Pattern Recognition
2015
Corpus ID: 2131202
Cross-scene crowd counting is a challenging task where no laborious data annotation is required for counting people in new target…
Expand
Highly Cited
2009
Highly Cited
2009
Model Counting
C. Gomes
,
Ashish Sabharwal
,
B. Selman
Handbook of Satisfiability
2009
Corpus ID: 17929848
Propositional model counting or #SAT is the problem of computing the number of models for a given propositional formula, i.e…
Expand
Highly Cited
2002
Highly Cited
2002
The parameterized complexity of counting problems
J. Flum
,
Martin Grohe
The 43rd Annual IEEE Symposium on Foundations of…
2002
Corpus ID: 16585036
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of…
Expand
Highly Cited
2002
Highly Cited
2002
The Complexity of Counting in Sparse, Regular, and Planar Graphs
S. Vadhan
SIAM journal on computing (Print)
2002
Corpus ID: 18392423
We show that a number of graph-theoretic counting problems remain ${\cal NP}$-hard, indeed $\#{\cal P}$-complete, in very…
Expand
Highly Cited
2000
Highly Cited
2000
The Relative Complexity of Approximate Counting Problems
M. Dyer
,
L. A. Goldberg
,
Catherine S. Greenhill
,
M. Jerrum
Algorithmica
2000
Corpus ID: 19343716
AbstractTwo natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those…
Expand
Highly Cited
1989
Highly Cited
1989
Approximating the Permanent
M. Jerrum
,
A. Sinclair
SIAM journal on computing (Print)
1989
Corpus ID: 2986685
A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of…
Expand
Highly Cited
1988
Highly Cited
1988
Comparing Biases for Minimal Network Construction with Back-Propagation
S. Hanson
,
L. Pratt
Neural Information Processing Systems
1988
Corpus ID: 9344018
Rumelhart (1987), has proposed a method for choosing minimal or "simple" representations during learning in Back-propagation…
Expand
Highly Cited
1986
Highly Cited
1986
Random Generation of Combinatorial Structures from a Uniform Distribution
M. Jerrum
,
L. Valiant
,
V. Vazirani
Theoretical Computer Science
1986
Corpus ID: 266961
Highly Cited
1983
Highly Cited
1983
The complexity of approximate counting
Larry Stockmeyer
Symposium on the Theory of Computing
1983
Corpus ID: 261943412
There are several computational problems that can be formulated as problems of counting the number of objects having a certain…
Expand
Highly Cited
1979
Highly Cited
1979
The Complexity of Computing the Permanent
L. Valiant
Theoretical Computer Science
1979
Corpus ID: 1637832
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE