Abstract. A categorical version of the famous theorem of Stone and Weierstrass is formulated and studied in detail. Several applications and examples are given.
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
—We present a generalized sampling theorem allowing reconstructions in arbitrary bases. The classical Shannon Sampling Theorem is a special case of our theorem. Specifically, we...
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit fun...
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...