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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in $\#$P, is by…

2014

Model-counting is the #P problem of counting the number of satisfying solutions of a given propositional formula. Here we focus…

2011

Computing the marketmaker price of a security in a combinatorial prediction market is #P-hard. We devise a fully polynomial…

2010

Today we describe counting problems and the class #P that they define, and we show that every counting problem #P can be…

2006

Background: Pregnancy is a condition that favors oxidative stress mostly because of the mitochondria-rich placenta. Transitional…

2005

Image fusion aims at the exploitation of the information conveyed by data acquired by different imaging sensors. A notable…

2002

This paper discusses the reliability of distributed systems in which nodes may fail with certain probabilities. The distributed…

2001

!$# &%' (# ) * !+ !, )# . / ) 0 1) 2! 3 ( 45 ( 16 7 ) 8 9 ) ):<;=# ( > ) (# )?/@ ) 2! A )% . B BC D ! %E ' FB ) G# ( )BH IJ…

2001

This thesis explores the relationship between age, class and gender among female munitions workers at the government explosives…

1995

Recently, fully polynomial randomized approximation scheme for computing the network reliability have been developed by Alon…