On randomized complexity of functions approximating the majority function
From MaRDI portal
Publication:2746911
zbMATH Open0973.68078MaRDI QIDQ2746911
Publication date: 11 October 2001
Published in: Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 (Search for Journal in Brave)
Related Items (3)
On approximate majority and probabilistic time ⋮ On the complexity of finite random functions ⋮ Randomized algorithms for the majority problem
This page was built for publication: On randomized complexity of functions approximating the majority function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746911)
