MARC 닫기
00429nam ac200169 k 4500
000003583435
20220101120000
ta
010731s1992 US 000 eng
▼a 211070
▼c 211070
▼l WM0003027487
▼a QA298
▼a QA298
▼b N57
▼a USING HARD PROBLEMS TO CREATE PSEUDORANDOM GENERATORS/
▼d NISAN,NOAM
▼a CAMBRIDGE:
▼b MIT PR.,
▼c 1992.
▼a 43p.
▼a NISAN,NOAM
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | QA298 |
| 서명/저자사항 : | USING HARD PROBLEMS TO CREATE PSEUDORANDOM GENERATORS/ NISAN,NOAM |
| 발행사항 : | CAMBRIDGE: MIT PR., 1992. |
| 형태사항 : | 43p. |
| 개인저자 : | NISAN,NOAM |
| 언어 | 영어 |
WMO199927245
권 호 : 43
발행년 : 1992
서 명 : USING HARD PROBLEMS TO CREATE PSEUDORANDOM GENERATORS
발행처 : NISAN,NOAM
목차
1. INTRODUCTION
2. RANDOMIZED COMPLEXITY
3. PSEUDORANDOM GENERATORS
4. BASIC DEFINITIONS
5. PREVIOUS WORK
6. HARDNESS VS. RANDOMNESS
7. PSEUDORANDOM GENERATORS FOR LOGSPACE
8. RECENT RESULTS
9. HARDNESS VS. RANDOMNESS
10. THE GENERATOR
11. MAIN COROLLARIES
12. MULTIPARTY PROTOCOLS AND PSEUDORANDOM GENERATORS FOR LOGSPACE
13. MULTIPARTY COMMUNICATION COMPLEXITY
14. PSEUDORANDOM GENERATORS FOR LOGSPACE
15. RECENT RESULTS
16. APPROXIMATING VS. COMPUTING ...
서평쓰기