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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2017
0102019852017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper presents several definitions of “optimal patterns” in triadic data and results of experimental comparison of five… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this… (More)
  • figure 1
  • figure 2
  • table 1
  • table 4
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is… (More)
  • table 1
Is this relevant?
2008
2008
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk… (More)
Is this relevant?
2005
2005
Determining the number of solutions of a CSP has several applications in AI, in statistical physics, and in guiding backtrack… (More)
  • table 1
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?
2005
2005
Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity assumption on… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree ∆. The first… (More)
Is this relevant?