7228 search results - page 34 / 1446 » From Algorithmic to Subjective Randomness |
111
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
SIAMCOMP
2008
14 years 9 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
73
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...