Publications
Search

Publications :: Search

Show venue

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

    Journal
    Name: Electronic Colloquium on Computational Complexity (ECCC)
    Year: 2017
    Volume: 24
    DBLP: db/journals/eccc/eccc24.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 96  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Frantisek Duris.
    Some notes on two lower bound methods for communication complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Journal article
    Stephen A. Cook, Bruce M. Kapron.
    A Survey of Classes of Primitive Recursive Functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Journal article
    Yi Deng.
    Magic Adversaries Versus Individual Reduction: Science Wins Either Way.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Journal article
    Scott Aaronson.
    P=?NP.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Michael A. Forbes, Amir Shpilka, Ben lee Volk.
    Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Joshua A. Grochow, Mrinal Kumar 0001, Michael E. Saks, Shubhangi Saraf.
    Towards an algebraic natural proofs barrier via polynomial identity testing.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan.
    On polynomial approximations over ?/2
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau.
    Emptiness Problems for Integer Circuits.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Oded Goldreich, Guy N. Rothblum.
    Simple doubly-efficient interactive proof systems for locally-characterizable sets.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Neeraj Kayal, Vineet Nair, Chandan Saha 0001, Sébastien Tavenas.
    Reconstruction of full rank Algebraic Branching Programs.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Show item 1 to 10 of 96  

    Your query returned 96 matches in the database.