External Links

    Journal: Computational Complexity

    Volume 35, Issue 2

    6 -- 0Florent Capelli, Yann Strozecki. From amortized to worst case delay in enumeration algorithms

    Volume 35, Issue 1

    1 -- 0Greta Panova. Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
    2 -- 0Aleksandrs Belovs, Ansis Rosmanis. Tight Quantum Lower Bound for Approximate Counting with Quantum States
    3 -- 0Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan 0001, Sébastien Tavenas. Towards Optimal Depth-Reductions for Algebraic Formulas
    4 -- 0Guy Blanc, Caleb Koch 0001, Carmen Strassle, Li-Yang Tan. A strong direct sum theorem for distributional query complexity
    5 -- 0Amir Shpilka. On Approximate Symmetric Polynomials and Tightness of Homogenization Results
    runs on