Publications
Search

Publications :: Search

Show venue

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

    Journal
    Name: Computational Complexity
    Year: 2012
    Volume: 21
    Number: 1
    DBLP: db/journals/cc/cc21.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 20  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Andrej Bogdanov, Youming Qiao.
    On the security of Goldreich's one-way function.
    Computational Complexity 2012, Volume 21 (0) 2012
    Journal article
    Oded Goldreich, Salil P. Vadhan.
    Special issue from RANDOM'09: Editors' Foreword.
    Computational Complexity 2012, Volume 21 (0) 2012
    Journal article
    Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg.
    Hierarchy Theorems for Property Testing.
    Computational Complexity 2012, Volume 21 (0) 2012
    Journal article
    Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel.
    Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds.
    Computational Complexity 2012, Volume 21 (0) 2012
    Journal article
    Ido Ben-Eliezer, Rani Hod, Shachar Lovett.
    Random low-degree polynomials are hard to approximate.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Shachar Lovett, Emanuele Viola.
    Bounded-Depth Circuits Cannot Sample Good Codes.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Eric Blais, Joshua Brody, Kevin Matulef.
    Property Testing Lower Bounds via Communication Complexity.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Anup Rao.
    Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Eli Ben-Sasson, Michael Viderman.
    Towards lower bounds on locally testable codes via density arguments.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Andrew Drucker.
    Improved direct product theorems for randomized query complexity.
    Computational Complexity 2012, Volume 21 (0) 2012
    Show item 1 to 10 of 20  

    Your query returned 20 matches in the database.