Get started
Author

Valentine Kabanets

Observed names: KABANETS, VALENTINE, Kabanets, Valentine, V. Kabanets, VALENTINE KABANETS
ORCID: 0009-0002-2861-017X
Observed ORCID: 0009-0002-2861-017X
OpenAlex ID: A5066747130
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
2004 · Valentine Kabanets, Russell Impagliazzo · Computational Complexity · 378
In search of an easy witness: exponential time vs. probabilistic polynomial time
2002 · Russell Impagliazzo, Valentine Kabanets, et al. · Journal of Computer and System Sciences · 213
PDF
Circuit minimization problem
2000 · Valentine Kabanets, Jin-Yi Cai · ACM Symposium on Theory of Computing (STOC) · 143
PDF
Derandomizing polynomial identity tests means proving circuit lower bounds
2003 · Valentine Kabanets, Russell Impagliazzo · ACM Symposium on Theory of Computing (STOC) · 104
Constructive Proofs of Concentration Bounds
2010 · Russell Impagliazzo, Valentine Kabanets · Lecture notes in computer science · 70
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
2001 · Valentine Kabanets · Journal of Computer and System Sciences · 68
PDF
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
2010 · Russell Impagliazzo, Ragesh Jaiswal, et al. · SIAM Journal on Computing · 62
On the Complexity of Succinct Zero-Sum Games
2005 · Lance Fortnow, Russell Impagliazzo, et al. · Computational Complexity · 56
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
2007 · Chris Calabro, Russell Impagliazzo, et al. · Journal of Computer and System Sciences · 55
PDF
Derandomization: a Brief Overview
2004 · VALENTINE KABANETS · WORLD SCIENTIFIC eBooks · 45
Derandomizing polynomial identity tests means proving circuit lower bounds
2003 · Valentine Kabanets, Russell Impagliazzo · 42
Learning Algorithms from Natural Proofs
2016 · Carmosino, Marco L., Impagliazzo, Russell, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 36
PDF
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
2006 · Russell Impagliazzo, Ragesh Jaiswal, et al. · Annual Symposium on Foundations of Computer Science · 36
Uniform direct product theorems
2008 · Russell Impagliazzo, Ragesh Jaiswal, et al. · 35
Mining Circuit Lower Bound Proofs for Meta-Algorithms
2015 · Ruiwen Chen, Valentine Kabanets, et al. · Computational Complexity · 33
New Direct-Product Testers and 2-Query PCPs
2012 · Russell Impagliazzo, Valentine Kabanets, et al. · SIAM Journal on Computing · 28
The Minimum Oracle Circuit Size Problem
2016 · Eric Allender, Dhiraj Holden, et al. · Computational Complexity · 27
Security Amplification for Interactive Cryptographic Primitives
2009 · Yevgeniy Dodis, Russell Impagliazzo, et al. · Lecture notes in computer science · 27
PDF
Chernoff-Type Direct Product Theorems
2008 · Russell Impagliazzo, Ragesh Jaiswal, et al. · Journal of Cryptology · 25
PDF
Easiness assumptions and hardness tests: trading time for zero error
2002 · V. Kabanets · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 24
Mining Circuit Lower Bound Proofs for Meta-algorithms
2014 · Ruiwen Chen, Valentine Kabanets, et al. · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 23
Uniform Hardness Amplification in NP via Monotone Codes
2006 · Joshua Buresh-Oppenheim, Valentine Kabanets, et al. · Electronic colloquium on computational complexity · 23
New direct-product testers and 2-query PCPs
2009 · Russell Impagliazzo, Valentine Kabanets, et al. · ACM Symposium on Theory of Computing (STOC) · 22
An axiomatic approach to algebrization
2009 · Russell Impagliazzo, Valentine Kabanets, et al. · ACM Symposium on Theory of Computing (STOC) · 20
The complexity of unique k-SAT: an isolation lemma for k-CNFs
2004 · C. Calabro, R. Impagliazzo, et al. · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 19
Works count: 122
Citation count: 1,914
H-index: 22
I10-index: 35
Year
Topic
Type