Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

39 relations
2-satisfiabilityBEST theoremBayesian networkBelief propagation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Enumeration of perfect matchings of lattice graphs by Pfaffians
2018
2018
Mining Top-k Sequential Patterns in Database Graphs: A New Challenging Problem and a Sampling-based Approach
In many real world networks, a vertex is usually associated with a transaction database that comprehensively describes the… 
2015
2015
A Novel OBDD-Based Reliability Evaluation Algorithm for Wireless Sensor Networks on the Multicast Model
The two-terminal reliability calculation for wireless sensor networks (WSNs) is a #P-hard problem. The reliability calculation of… 
2012
2012
From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract)
We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for… 
2011
2011
Dominating Set Counting in Graph Classes
We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time… 
2011
2011
A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges
  • Wei DingG. Xue
  • Discret. Math. Algorithms Appl.
  • 2011
  • Corpus ID: 39962026
Given an unreliable communication network, we seek a most reliable source (MRS) of the network, which maximizes the expected… 
2010
2010
An Approximation Algorithm for the Coefficients of the Reliability Polynomial | NIST
The reliability polynomial gives the probability that a graph remains connected given that each edge in it can fail independently… 
2009
2009
Finding a Level Ideal of a Poset
This paper is concerned with finding a level ideal (LI ) of a partially ordered set (poset): given a finite poset P , a level of… 
2005
2005
On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata
We study computational complexity of counting the fixed point configurations (FPs) in certain discrete dynamical systems. We… 
1992
1992
Minimum-expected-delay alternate routing
The authors consider the problem of finding a routing strategy that minimizes the expected delay from every source to a single… 
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)