External Links

    Journal: Computational Complexity

    Volume 33, Issue 2

    8 -- 0Miroslav Rada, Michal Cerný, Ondrej Sokol. The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
    9 -- 0Laurence Kluge. Combinatorial refinement on circulant graphs
    10 -- 0Zeyu Guo 0001. Variety Evasive Subspace Families
    11 -- 0Abhranil Chatterjee 0001, Mrinal Kumar 0001, Ben lee Volk. Determinants vs. Algebraic Branching Programs
    12 -- 0Ján Pich. Localizability of the approximation method
    13 -- 0Dominik Scheder, John P. Steinberger. PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster
    runs on