文章基本信息
- 标题：Monotone Circuits: One-Way Functions versus Pseudorandom Generators
- 本地全文：下载
- 作者：Oded Goldreich ; Rani Izsak
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2011
- 卷号：2011
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two:On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course)that one-way functions exist at all.On the other hand, no monotone function can be a pseudorandom generator.
