External Links

    Journal: Computational Complexity

    Volume 15, Issue 3

    197 -- 235Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois. The complexity of semilinear problems in succinct representation
    236 -- 251Saugata Basu. Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
    252 -- 262Nader H. Bshouty, Michael Kaminski. Polynomial multiplication over finite fields: from quadratic to straight-line complexity
    263 -- 296Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval
    runs on