Concepedia
Statistics
Publications
24
Citations
1.4K
H-Index
20
Active since
2000
Affiliations
Simon Fraser University(Current)
University of California San Diego
Institute for Advanced Study
Memorial University of Newfoundland
University of Toronto
Valentine Kabanets is an author at Simon Fraser University specializing in computing, algorithms, and computer science.
Publications per year
2000–2016
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Valentine Kabanets, Russell Impagliazzo · Computational Complexity · 2004 · 384 citations
Computing, Computer Science, Mathematics +16
In search of an easy witness: exponential time vs. probabilistic polynomial time
Russell Impagliazzo, Valentine Kabanets, Avi Wigderson · Journal of Computer and System Sciences · 2002 · 214 citations
Computing, Computer Science, Mathematics +17
Derandomizing polynomial identity tests means proving circuit lower bounds
Valentine Kabanets, Russell Impagliazzo · 2003 · 105 citations
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
Valentine Kabanets · Journal of Computer and System Sciences · 2001 · 68 citations
Computing, Economics, Formal Methods +4
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets et al. · SIAM Journal on Computing · 2010 · 62 citations
Computing, Computer Science, Mathematics +15
1–5 of 24