External Links

    Journal: Computational Complexity

    Volume 23, Issue 4

    509 -- 529Zeev Dvir, János Kollár, Shachar Lovett. Variety Evasive Sets
    531 -- 563Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma. Using Elimination Theory to Construct Rigid Matrices
    565 -- 583Jason Teutsch. Short lists for shortest descriptions in short time
    585 -- 636Alexis Maciel, Phuong Nguyen, Toniann Pitassi. Lifting lower bounds for tree-like proofs
    637 -- 669Martin Mundhenk, Felix Weiss. An AC 1-complete model checking problem for intuitionistic logic

    Volume 23, Issue 3

    355 -- 478Or Meir. Combinatorial PCPs with Efficient Verifiers
    479 -- 508Emanuele Viola. Randomness Buys Depth for Approximate Counting

    Volume 23, Issue 2

    147 -- 149Christopher Umans. Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword
    151 -- 175Daniel M. Kane. The correct exponent for the Gotsman-Linial Conjecture
    177 -- 205Rahul Santhanam, Ryan Williams. On Uniformity and Circuit Lower Bounds
    207 -- 303Ankit Gupta 0001, Neeraj Kayal, Youming Qiao. Random arithmetic formulas can be reconstructed efficiently
    305 -- 322Andris Ambainis, Ronald de Wolf. How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
    323 -- 354Aleksandrs Belovs, Ansis Rosmanis. On the Power of Non-adaptive Learning Graphs

    Volume 23, Issue 1

    1 -- 42Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb. Choosing, Agreeing, and Eliminating in Communication Complexity
    43 -- 83Sergei Artemenko, Ronen Shaltiel. Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
    85 -- 98Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran. ReachFewL = ReachUL
    99 -- 146Matei David, Periklis A. Papakonstantinou. Tradeoff lower lounds for stack machines
    runs on