#P-complete, pronounced "sharp P complete" or "number P complete" is a complexity class in computational complexity theory. By definition, a problem… (More)

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

2015

2015

- Dmitry I. Ignatov, Dmitry Gnatyshak, Sergei O. Kuznetsov, Boris G. Mirkin
- Machine Learning
- 2015

This paper presents several definitions of “optimal patterns” in triadic data and results of experimental comparison of five… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang
- PVLDB
- 2011

Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Karl Bringmann, Tobias Friedrich
- ISAAC
- 2008

We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is… (More)

Is this relevant?

2008

2008

- Peter C. Richter
- 2008

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk… (More)

Is this relevant?

2005

2005

- Gilles Pesant
- IJCAI
- 2005

Determining the number of solutions of a CSP has several applications in AI, in statistical physics, and in guiding backtrack… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Tian Sang, Paul Beame, Henry A. Kautz
- AAAI
- 2005

Over the past decade general satisfiability testing algorithms have proven to be surprisingly effective at solving a wide variety… (More)

Is this relevant?

2005

2005

- Kin-Ping Hui, Nigel Bean, Miro Kraetzl, Dirk P. Kroese
- Annals OR
- 2005

Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Andreas Krause, Carlos Guestrin
- IJCAI
- 2005

Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Luca Trevisan, Salil P. Vadhan
- computational complexity
- 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

- Martin E. Dyer, Alan M. Frieze, Mark Jerrum
- FOCS
- 1999

We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree ∆. The first… (More)

Is this relevant?