𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nondiamond theorems for polynomial time reducibility

✍ Scribed by Rod Downey

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
694 KB
Volume
45
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Testing a Bivariate Polynomial for An
On Testing a Bivariate Polynomial for Analytic Reducibility
✍ Scott McCallum πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 618 KB

Let K be an algebraically closed field of characteristic zero. We present an efficient algorithm for determining whether or not a given polynomial f (x, y) in K[x, y] is analytically reducible over K at the origin. The algorithm presented is based upon an informal method sketched by Kuo (1989) which

A Wiener Theorem for Orthogonal Polynomi
A Wiener Theorem for Orthogonal Polynomials
✍ V. Hosel; R. Lasser πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 202 KB

A well-known theorem by \(\mathrm{N}\). Wiener characterizes the discrete part of a complex Borel measure \(\mu \in \mathbf{M}(T)\) on the torus group \(T\). In this note an analoguous result is presented for orthonormal polynomial sequences \(\left(p_{n}\right)_{n \in n_{0}}\). For Jacobi polynomia