Articles not assigned to an issue (12 articles)

1. 

   OriginalPaper

   Modular Composition Modulo Triangular Sets and Applications

   Adrien Poteaux, Éric Schost

   Look Inside Get Access

2. 

   OriginalPaper

   Lifting lower bounds for tree-like proofs

   Alexis Maciel, Phuong Nguyen, Toniann Pitassi

   Look Inside Get Access

3. 

   OriginalPaper

   Using Elimination Theory to Construct Rigid Matrices

   Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar…

   Look Inside Get Access

4. 

   OriginalPaper

   An AC ¹-complete model checking problem for intuitionistic logic

   Martin Mundhenk, Felix Wei

   Look Inside Get Access

5. 

   OriginalPaper

   Space Functions and Space Complexity of the Word Problem in Semigroups

   A. Yu. Olshanskii

   Look Inside Get Access

6. 

   OriginalPaper

   Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

   Sergei Artemenko, Ronen Shaltiel

   Look Inside Get Access

7. 

   OriginalPaper

   Tradeoff lower lounds for stack machines

   Matei David, Periklis A. Papakonstantinou

   Look Inside Get Access

8. 

   OriginalPaper

   Hadamard tensors and lower bounds on multiparty communication complexity

   Jeff Ford, Anna Gál

   Look Inside Get Access

9. 

   OriginalPaper

   Pseudorandom generators for CC⁰[p] and the Fourier spectrum of low-degree polynomials over finite fields

   Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka

   Look Inside Get Access

10. 

    OriginalPaper

    ReachFewL = ReachUL

    Brady Garvin, Derrick Stolee, Raghunath Tewari…

    Look Inside Get Access

11. 

    OriginalPaper

    Improved Approximation of Linear Threshold Functions

    Ilias Diakonikolas, Rocco A. Servedio

    Look Inside Get Access

12. 

    OriginalPaper

    Pseudorandom generators for combinatorial checkerboards

    Thomas Watson

    Look Inside Get Access