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)

Related topics

Related topics

16 relations
2-satisfiabilityComplexity classComputability theoryComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Tree-Decompositions with Connected Clusters for Solving Constraint Networks
From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems… 
2012
2012
Minimizing the number of lattice points in a translated polygon
@m. Our main result is a proof that finding such a minimizing parameter is NP-hard, even in dimension 2 and even if the… 
2010
2010
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real… 
2009
2009
Optimal Prefetching Scheme in P2P VoD Applications With Guided Seeks
Most existing peer-to-peer (P2P) video-on-demand (VoD) systems have been designed and optimized for the sequential playback. In… 
Highly Cited
2006
Highly Cited
2006
Method for simulating electroweak top-quark production events in the NLO approximation: SingleTop event generator
A new method for simulating electroweak top-quark production processes is described along with its computer realization in the… 
2002
2002
Finding General Solutions to the Parity Problem by Evolving Machine-Language Representations
Evolutionary search on a machinelanguage program representation is used to nd exact and general solutions to the bit-counting… 
1999
1999
Value-Update Rules for Real-Time Search
Real-time search methods have successfully been used to solve a large variety of search problems but their properties are largely… 
1990
1990
Numbers Not Everything
a big problem, especially, but not exclusively, in the sciences. During my first few years as a faculty member, salary increases… 
Highly Cited
1983
Highly Cited
1983
Within-Plant Distribution of Spider Mites (Acari: Tetranychidae) on Cotton: A Developing Implementable Monitoring Program
The vertical distribution of spider mites, Tetranychus spp., on cotton is largely determined by the phenological stage of crop… 
1964
1964
Alpha decay properties of some terbium and dysprosium isotopes near the 82-neutron closed shell
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)