1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2025
A Simple Algorithm for Trimmed Multipoint Evaluation
Nick Fischer, Melvin Kallmayer, Leo Wennmann
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $…
cs.CC2024
Solving Polynomial Equations Over Finite Fields
Holger Dell, Anselm Haak, Melvin Kallmayer +1
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 b…
cs.DS2024★ 1 cited
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
Nick Fischer, Leo Wennmann
In this work we revisit the elementary scheduling problem . The goal is to select, among jobs with processing times and due dates, a subset of jobs with maximu…