The three books reviewed in this column are about central ideas in algorithms, complexity, and geometry. The third one brings together topics from the first two by applying techniques of both property testing (the subject of the first book) and parameterized complexity (including its more focused incarnation studied in the second book, kernelization) to geometric problems.
For any set S and any entire function f letwhere each zero of f — a with multiplicity m is repeated m times in Ef(S) (cf. [1]). It is assumed that the reader is familiar with the notations of the Nevanlinna Theory (see, for example, [2]). It will be convenient to let E denote any set of finite linear measure on 0 < r < ∞, not necessarily the same at each occurrence. We denote by S(r, f) any quantity satisfying .
Nevanlinna Theory for Jackson Difference Operators and Entire Solutions of q-Difference Equations