Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Wennmann, Leo"'
We present a randomized algorithm for solving low-degree polynomial equation systems over finite fields faster than exhaustive search. In order to do so, we follow a line of work by Lokshtanov, Paturi, Tamaki, Williams, and Yu (SODA 2017), Bj\"orklun
Externí odkaz:
http://arxiv.org/abs/2410.20162
Autor:
Fischer, Nick, Wennmann, Leo
In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence without viol
Externí odkaz:
http://arxiv.org/abs/2402.13357