DocumentCode :
1632374
Title :
Pseudo-random generators for all hardnesses
Author :
Umans, Christopher
Author_Institution :
Microsoft Research
fYear :
2002
fDate :
6/24/1905 12:00:00 AM
Firstpage :
7
Lastpage :
7
Keywords :
Circuits; Complexity theory; Computational complexity; Computer science; Encoding; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
ISSN :
1093-0159
Print_ISBN :
0-7695-1468-5
Type :
conf
DOI :
10.1109/CCC.2002.1004326
Filename :
1004326
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1632374
