827 search results - page 5 / 166 » The Complexity of Probabilistic Lobbying |
CSL
2010
Springer
14 years 11 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
100
click to vote
JCST
2010
14 years 6 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
JC
2006
14 years 11 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
SIAMCOMP
2008
14 years 11 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
JMLR
2010
14 years 6 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...