发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2011 Volume 6907 || An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2011 Volume 6907 || An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers

Murlak, Filip; Sankowski, Piotr

作者Murlak, Filip; Sankowski, Piotr
文件大小179.08KB
发表时间2011
DOI10.1007/978-3-642-22993-0_25
页码256-265

← 返回【学霸图书馆】主页