Combined complexity classes for finite functions

From existing results for the standard setting, where all predicates are interpreted under the open world assumption, and the well-known relationship between closed predicates

By the very essence of this discipline, the foundations of information theory must have a nite combinatorial character." It is the aim of this paper to derive randomness

Given an integer d, and a D-finite function f specified by a differential equation with polynomial coefficients and suitable boundary conditions, find the coefficients of a

Top- pila [6] showed that there are no Picard sets consisting of countable unions of small discs for meromorphic functions in general, marking a departure.. from the

L’accès aux archives de la revue « Annali della Scuola Normale Superiore di Pisa, Classe di Scienze » ( http://www.sns.it/it/edizioni/riviste/annaliscienze/ ) implique l’accord

Therefore, we note that so far, practical implementations of multiplication algorithms of type Chudnovsky over finite fields have failed to simultaneously optimize the number of

For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual lan- guage complexity function counting the finite

By definition of generalized normal derivative, if v is in %(0, A) (14. If A has zero harmonic measure, v can be chosen to make b^/^g any function in I^R^ orthogonal to 1. 2) is