Sharp-P

Known as: Sharp-P (class), Sharp P, P (disambiguation) 
In computational complexity theory, the complexity class #P (pronounced "number P" or, sometimes "sharp P" or "hash P") is the set of the counting… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The management of uncertainty is crucial when harvesting structured content from unstructured and noisy sources. Knowledge Graphs… (More)
  • figure 1
  • table 1
Is this relevant?
2015
2015
We address the design problem of a reliable network. Previous work assumes that link failures are independent. We discuss the… (More)
  • table 1
  • figure 1
Is this relevant?
2014
2014
This article develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We study the problem of enhancing Entity Resolution (ER) with the help of crowdsourcing. ER is the problem of clustering records… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Kempe et al. [4] (KKT) showed the problem of influence maximization is NP-hard and a simple greedy algorithm guarantees the best… (More)
  • table 1
Is this relevant?
2008
2008
Assignment words ensure that two conflicting literals can never be used to satisfy two clauses. Extra literals consistent with… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Aggregating the preferences of self-interested agents is a key problem for multiagent systems, and one general method for doing… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Over the past decade general satisfiability testing algorithms have proven to be surprisingly effective at solving a wide variety… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. This… (More)
  • figure 2
  • 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?