[ACM Press the thirty-eighth annual ACM symposium - Seattle, WA, USA (2006.05.21-2006.05.23)] Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 - Can every randomized algorithm be derandomized?
Impagliazzo, RussellAnnée:
2006
Langue:
english
DOI:
10.1145/1132516.1132571
Fichier:
PDF, 50 KB
english, 2006