Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Valentine
    Last name: Kabanets
    DBLP: k/ValentineKabanets
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 80  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich.
    The Power of Natural Properties as Oracles.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Journal article
    Russell Impagliazzo, Valentine Kabanets.
    Fourier Concentration from Shrinkage.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Eric Allender, Dhiraj Holden, Valentine Kabanets.
    The Minimum Oracle Circuit Size Problem.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A Polynomial Restriction Lemma with Applications.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A polynomial restriction lemma with applications.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani.
    Does Looking Inside a Circuit Help?
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova.
    Agnostic Learning from Tolerant Natural Proofs.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Conference paper
    Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova.
    Algorithms from Natural Lower Bounds.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel.
    Pseudorandomness when the odds are against you.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel.
    Pseudorandomness When the Odds are Against You.
    31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan 2016 (0) 2016
    Show item 1 to 10 of 80  

    Your query returned 80 matches in the database.