Results 301 to 310 of about 237,114 (316)

A parallel complex zero finder

Reliable Computing, 1995
The authors parallelize an algorithm presented by \textit{M. J. Schaefer} [Interval Comput. 1993, No. 4, 22-39 (1993; Zbl 0829.65063)] for verifying zeros of analytic functions in the complex plane. This algorithm is based on a bisection strategy, the winding number and Newton's method.
Schaefer, Mark J., Bubeck, Tilmann
openaire   +2 more sources

Zeros of complex homogeneous polynomials

Linear and Multilinear Algebra, 2007
It is known that for any positive integers n and d, there is a positive integer m such that for every d-homogeneous polynomial has an n-dimensional subspace XP , XP⊂ P−1(0). We discuss the problem of finding a good bound for m as a function of d and n.
Mary Lillian Lourenço, Neusa Nogas Tocha   +1 more
openaire   +1 more source

The Complexity of Perfect Zero-Knowledge

Proceeding Structure in Complexity Theory, 1987
A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol.
openaire   +1 more source

Additive Complexity and Zeros of Real Polynomials

SIAM Journal on Computing, 1985
Let \(P\in {\mathbb{R}}[X]\) be a polynomial with coefficients in the field \({\mathbb{R}}\). The additive complexity k of P is the minimal number of additions and subtractions required to compute P over \({\mathbb{R}}\). It is proved that there exists a constant C such that the number of distinct real zeros of P is \(\leq C^{k^ 2}\).
openaire   +2 more sources

The Complexity of Zero Knowledge

2007
We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right.
openaire   +1 more source

Complex zeros of an elliptic integral

Functional Analysis and Its Applications, 1987
Translation from Funkts. Anal. Prilozh. 21, No.3, 87-88 (Russian) (1987; Zbl 0625.33001).
openaire   +2 more sources

Zero-sets of complex homogeneous polynomials

Linear and Multilinear Algebra, 2008
In this paper we study the zero-sets of continuous n-homogeneous polynomials on complex nonseparable Banach spaces. We prove that the zero-set of any complex n-homogeneous polynomial P is a subspace if, and only if, there is a functional ϕ such that P(x)=ϕ (x)n for every x.
openaire   +1 more source

Complex zeros of analytic functions

Computer Physics Communications, 1983
L.C. Botten, M.S. Craig, R.C. McPhedran
openaire   +1 more source

Active Realization of Complex Zeros

IEEE Transactions on Circuit Theory, 1963
N. Balabanian, B. Patel
openaire   +1 more source

Zeros of complex orthogonal polynomials

1985
openaire   +1 more source