-
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Alg...
International audience -
Representations of polynomials, algorithms and lower bounds
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically solve a problem. Within these settings, algebraic complexity theory...
