✦ LIBER ✦

Randomness complexity of private computation

✍ Scribed by C. Blundo; A. De Santis; G. Persiano; U. Vaccaro

Publisher: Springer
Year: 1999
Tongue: English
Weight: 422 KB
Volume: 8
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s000370050025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-randomness constant-round private XO

Low-randomness constant-round private XOR computations

✍ Carlo Blundo; Clemente Galdi; Giuseppe Persiano 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 343 KB

On The Randomness Complexity of Property

On The Randomness Complexity of Property Testing

✍ Oded Goldreich; Or Sheffet 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 631 KB

Private vs. common random bits in commun

Private vs. common random bits in communication complexity

✍ Ilan Newman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 492 KB

The Complexity of Stratification Computa

The Complexity of Stratification Computation

✍ E. Rannou 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 261 KB

Resource bounded randomness and computat

Resource bounded randomness and computational complexity

✍ Yongge Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 165 KB

The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is indepen

Computational complexity of random acces

Computational complexity of random access stored program machines

✍ J. Hartmanis 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 914 KB