Results 321 to 330 of about 3,709,601 (369)
Some of the next articles are maybe not open access.
Exact matching of random graphs with constant correlation
Probability theory and related fields, 2021This paper deals with the problem of graph matching or network alignment for Erdős–Rényi graphs, which can be viewed as a noisy average-case version of the graph isomorphism problem.
Cheng Mao, M. Rudelson, K. Tikhomirov
semanticscholar +1 more source
A polynomial-time classical algorithm for noisy quantum circuits
arXiv.orgWe provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the computational basis)
Thomas Schuster +3 more
semanticscholar +1 more source
John constants for polynomials
Complex Variables, Theory and Application: An International Journal, 1996Let g be some set of non-constant analytic functions in the unit disk D, and for f e dg define The quantity where g u is the set of univalent functions in g, is called the John constant of g. We discuss where T k consists of the trinomials In particular, we find We also establish a conjecture of Rahman and Szynal for univalent trinomials in T ...
openaire +1 more source
Polynomial Constants Are Decidable
2002Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs.
Markus Müller-Olm, Helmut Seidl
openaire +1 more source
Constant Regression Polynomials and the Wishart Distribution
SIAM Journal on Mathematical Analysis, 1989Summary: Results are obtained for the problems of constructing and characterizing scalar-valued polynomial statistics having constant regression on the mean of a random sample of Wishart matrices. The construction procedure introduced by \textit{B. Heller} [J. Multivariate Anal.
openaire +1 more source
Constant-round interactive proofs for delegating computation
Electron. Colloquium Comput. Complex., 2016The celebrated IP=PSPACE Theorem of Lund et-al. (J.ACM 1992) and Shamir (J.ACM 1992), allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely complicated statements (as long as they can be evaluated
Omer Reingold +2 more
semanticscholar +1 more source
Polynomial constants of motion in flat space
Journal of Mathematical Physics, 1984Some general results on commuting integrals for a Hamiltonian system are given. The question of the existence of integrals which are polynomial in the momenta is investigated and the results applied to a variety of mechanical systems.
openaire +1 more source
On the Polynomial Derivative Constant for an Ellipse
The American Mathematical Monthly, 1937Let Pn(z) be a polynomial* of degree n in z = x+iy and let j P (z) j < M on a set E, where M is a constant independent of n and z. The author has shownt that if the set E is bounded by an analytic Jordan curve C then j P ' (z)1 < K(C) MAln, where K(C) is a constant depending only on C. If C is the unit circle we know by a theorem of M. Rieszt that K(C)
openaire +1 more source
A new post-quantum multivariate polynomial public key encapsulation algorithm
Quantum Information Processing, 2022Randy Kuang +2 more
semanticscholar +1 more source
THE REDUCIBILITY OF CONSTANT-PERTURBED PRODUCTS OF CYCLOTOMIC POLYNOMIALS
International Journal of Number Theory, 2014In 1908, Schur raised the question of the irreducibility over ℚ of polynomials of the form f(x) = (x - a1)(x - a2)⋯(x - an) + 1, where the ai are distinct integers. Since then, many authors have addressed variations and generalizations of this question.
Harrington, Joshua +2 more
openaire +2 more sources