We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...