Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CSR
/
Paper
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms.
Dmitry Itsykson
Venue
National
CSR
Year
2010
Proceedings
CSR
DBLP record
conf/csr/Itsykson10 ↗
Browse the full
CSR paper archive
.