Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书


Using Hard Problems to Create Pseudorandom Generators

简体网页||繁体网页

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书 著者简介


Using Hard Problems to Create Pseudorandom Generators 电子书 图书目录




点击这里下载
    


想要找书就要到 本本书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

发表于2024-11-26

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书



喜欢 Using Hard Problems to Create Pseudorandom Generators 电子书 的读者还喜欢


Using Hard Problems to Create Pseudorandom Generators 电子书 读后感

评分

评分

评分

评分

评分

类似图书 点击查看全场最低价
出版者:The MIT Press
作者:Noam Nisan
出品人:
页数:53
译者:
出版时间:2003-3-17
价格:USD 18.00
装帧:Paperback
isbn号码:9780262640527
丛书系列:The MIT Press Classics Series

图书标签: 计算机  算法   


Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书 图书描述

Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic complexity classes by pursuing the idea of emulating randomness, or pseudorandom generation.Pseudorandom generators reduce the number of random bits required by randomized algorithms, enable the construction of certain cryptographic protocols, and shed light on the difficulty of simulating randomized algorithms by deterministic ones. The research described here deals with two methods of constructing pseudorandom generators from hard problems and demonstrates some surprising connections between pseudorandom generators and seemingly unrelated topics such as multiparty communication complexity and random oracles.Nisan first establishes a precise connection between computational complexity and pseudorandom number generation, revealing that efficient deterministic simulation of randomized algorithms is possible under much weaker assumptions than was previously known, and bringing to light new consequences concerning the power of random oracles. Using a remarkable argument based on multiparty communication complexity, Nisan then constructs a generator that is good against all tests computable in logarithmic space. A consequence of this result is a new construction of universal traversal sequences.Noam Nisan is Lecturer in the Department of Computer Science at Hebrew University in Jerusalem. He received his doctoral degree from the University of California, Berkeley.Contents: Introduction. Hardness vs. Randomness. Pseudorandom Generators for Logspace and Multiparty Protocols.

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书
想要找书就要到 本本书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 用户评价

评分

评分

评分

评分

评分

Using Hard Problems to Create Pseudorandom Generators 2024 pdf epub mobi 电子书


分享链接









相关图书




本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

友情链接

© 2024 onlinetoolsland.com All Rights Reserved. 本本书屋 版权所有