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
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… 
2017
2017
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
Time-triggered switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems… 
2017
2017
On the Complexity of Bundle-Pricing and Simple Mechanisms
We show that the problem of finding an optimal bundle-pricing for a single additive buyer is #P-hard, even when the distributions… 
2017
2017
Note on "The Complexity of Counting Surjective Homomorphisms and Compactions"
Focke, Goldberg, and Živný (arXiv 2017) prove a complexity dichotomy for the problem of counting surjective homomorphisms from a… 
2010
2010
The Complexity of Partition Functions on Hermitian Matrices
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial… 
2010
2010
A Minimum Spanning Tree for the # 2 SAT Problem
#2SAT is a classical #P-complete problem. We present here, a novel algorithm for given a 2-CF Σ, to build a minimum spanning tree… 
2006
2006
On the Computational Complexity of Predicting Dynamical Evolution of Large Agent Ensembles
We study global behavior of large ensembles of simple reactive agents. We do so by applying computational complexity tools to the… 
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… 
1996
1996
The Intractibility of the 2-critical Flow Problem in K-flow Graphs
A k-ow-graph is a single-source/single-sink acyclic graph which is the union of k arc-disjoint source-sink paths. Arcs have unit… 
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)