Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...