Displaying similar documents to “Polynomial parametrizations of length 4 Büchi sequences”

Polynomially Bounded Sequences and Polynomial Sequences

Hiroyuki Okazaki, Yuichi Futa (2015)

Formalized Mathematics

Similarity:

In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].

On perturbations of pluriregular sets generated by sequences of polynomial maps

Maciej Klimek (2003)

Annales Polonici Mathematici

Similarity:

It is shown that an infinite sequence of polynomial mappings of several complex variables, with suitable growth restrictions, determines a filled-in Julia set which is pluriregular. Such sets depend continuously and analytically on the generating sequences, in the sense of pluripotential theory and the theory of set-valued analytic functions, respectively.