Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Boolean satisfiability problemBoson samplingCanadian traveller problemChromatic polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Representative Query Answers on Uncertain Data
Our goal is to incorporate uncertainty information in the querying process to enhance results with probabilistic guarantees… 
2014
2014
Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling
In this paper, we introduce two types of query evaluation problems on uncertain graphs: expectation query evaluation and… 
2011
2011
Solving Cooperative Reliability Games
Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We… 
2011
2011
Failure filtrations for fenced sensor networks
In this paper we consider the question of sensor network coverage for a two-dimensional domain. We seek to compute the… 
2011
2011
The #CSP Dichotomy is Decidable
Bulatov (2008) and Dyer and Richerby (2010) have established the following dichotomy for the counting constraint satisfaction… 
2008
2008
Reliability of wireless sensor grids
Wireless sensor networks (WSNs) have many applications in industry and environmental monitoring where sensor nodes are deployed… 
1995
1995
A Unified Approach via BDD to the Network Reliability and Path Numbers
Recently, fully polynomial randomized approximation scheme for computing the network reliability have been developed by Alon… 
1993
1993
The Complexity of Finding Middle Elements
Seinosuke Toda introduced the class Mid P of functions that yield the middle element in the set of output values over all paths… 
1992
1992
Finding All Solutions if You can Find One
Author(s): Dechter, Rina; Itai, Alon | Abstract: We address the problem of enumerating (producing) all models of a given theory… 
Highly Cited
1991
Highly Cited
1991
Gap-deenable Counting Classes
The function class #P lacks an important closure property: it is not closed under subtraction. To remedy this problem, we… 
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)