Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Sharp-P-complete

Known as: Number-P hard, Sharp-P hard, ♯P-complete 
#P-complete, pronounced "sharp P complete" or "number P complete" is a complexity class in computational complexity theory. By definition, a problem… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
This work was supported by the National Natural Science Foundation of China, the Chinese Academy of Sciences, the National… Expand
Is this relevant?
2009
2009
htmlabstractIn this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The Counting Constraint Satisfaction Problem (${\rm \#CSP}(\mathcal{H})$) over a finite relational structure $\mathcal{H}$ can be… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We give a complexity theoretic classification of the counting versions of so-called H-colouring problems for graphs H that may… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • Leslie G. Valiant
  • 45th Annual IEEE Symposium on Foundations of…
  • 2004
  • Corpus ID: 6178788
We introduce a new notion of efficient reduction among computational problems. Classical reductions involve gadgets that map… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Mining maximal frequent itemsets is one of the most fundamental problems in data mining. In this paper we study the complexity… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We study several versions of the shortest-path problem when the map is not known in advanced, but is specified dynamically. We… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 2
Is this relevant?