1401 search results - page 26 / 281 » Randomness in Interactive Proofs |
ENTCS
2007
14 years 9 months ago
2007
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
MSCS
2006
14 years 9 months ago
2006
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...