Results 321 to 330 of about 7,833,680 (354)

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

Transcoding zeros within complex numerals

Neuropsychologia, 2003
This paper describes a patient (LD) showing a selective syntactic deficit in the production of Arabic numerals. Unlike in previously reported cases, LD's syntactic difficulties result in deletions rather than insertions of zeros, with a reduction of the number magnitude. The pattern of errors highlighted a distinction between "lexical zeros", i.e.
GRANA' A, LOCHY A, GIRELLI L, SERON X, SEMENZA, CARLO   +4 more
openaire   +4 more sources

Compositionally complex doping for zero-strain zero-cobalt layered cathodes

Nature, 2022
The high volatility of the price of cobalt and the geopolitical limitations of cobalt mining have made the elimination of Co a pressing need for the automotive industry1. Owing to their high energy density and low-cost advantages, high-Ni and low-Co or Co-free (zero-Co) layered cathodes have become the most promising cathodes for next-generation ...
Rui Zhang, Chunyang Wang, Peichao Zou, Ruoqian Lin, Lu Ma, Liang Yin, Tianyi Li, Wenqian Xu, Hao Jia, Qiuyan Li, Sami Sainio, Kim Kisslinger, Stephen E. Trask, Steven N. Ehrlich, Yang Yang, Andrew M. Kiss, Mingyuan Ge, Bryant J. Polzin, Sang Jun Lee, Wu Xu, Yang Ren, Huolin L. Xin   +21 more
openaire   +2 more sources

Exact statistics of complex zeros for Gaussian random polynomials with real coefficients

, 1996
k-point correlations of complex zeros for Gaussian ensembles of random polynomials of order N with real coefficients (GRPRC) are calculated exactly, following an approach of Hannay for the case of Gaussian random polynomials with complex coefficients ...
T. Prosen
semanticscholar   +1 more source

Zeros of Complex Polynomials

1993
We consider the complex polynomial p: C → C defined by $$p(z)=\sum\limits_{i=0}^n{{p_i}{z^i}},{p_i}\in\mathbb{C}{\text{, }}i=0, . . . , n, {p_n}\ne 0.$$ (1) (9.1) The Fundamental Theorem of algebra asserts that this polynomial has n zeros counted by multiplicity. Finding these roots is a non trivial problem in numerical mathematics.
Ulrich Kulisch, Rolf Hammer, Dietmar Ratz, Matthias Hocks   +3 more
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

Spectrally-Efficient Modulation on Conjugate-Reciprocal Zeros (SE-MOCZ) for Non-Coherent Short Packet Communications

IEEE Transactions on Wireless Communications
This paper proposes a non-coherent communication scheme for short packet communications (SPCs), called spectrally-efficient modulation on conjugate reciprocal zeros (SE-MOCZ).
A. Siddiqui, E. Bedeer, Ha H. Nguyen, Robert Barton   +3 more
semanticscholar   +1 more source

On The Zeros of Some Complex harmonic polynomials

Rendiconti del Circolo Matematico di Palermo Series 2
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adithya Mayya, Sarika Verma, Raj Kumar, Kuncham Syam Prasad   +3 more
openaire   +2 more sources

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