Results 11 to 20 of about 2,297,129 (216)
, 1992 Polynomiality of the Kojima-Megiddo-Mizuno Infeasible Interior Point Algorithm for Linear ...
Mizuno, S.
core +6 more sources
Asymptotics of Some Plancherel Averages via Polynomiality Results [PDF]
, 2023 Consider Young diagrams of $n$ boxes distributed according to the Plancherel measure. So those diagrams could be the output of the RSK algorithm, when applied to random permutations of the set $\{1,\ldots,n\}$.
Schachinger, Werner
core +1 more source
Algorithms for trigonometric polynomials [PDF]
Proceedings of the 2001 international symposium on Symbolic and algebraic computation, 2001 In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonometric polynomials, that is, polynomials in sin(x) and cos(x).
Jamie Mulholland, Michael B. Monagan
openaire +1 more source
Decomposition Algorithms for Tensors and Polynomials
SIAM Journal on Applied Algebra and Geometry, 2023 19 ...
Antonio Laface +2 more
openaire +3 more sources
Simple Algorithm for GCD of Polynomials
WSEAS TRANSACTIONS ON MATHEMATICS, 2022 Based on the Bezout approach we propose a simple algorithm to determine the gcd of two polynomials which doesn’t need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The algorithm needs only n steps for polynomials of degree n.
Pasquale Nardone, Giorgio Sonnino
openaire +3 more sources
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial [PDF]
Algorithmica, 2006 The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory (TQFT).
Dorit Aharonov +2 more
openaire +3 more sources
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +3 more sources
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire +5 more sources
An Algorithm for Polynomial Operations [PDF]
The Computer Journal, 1967 Recent interest in the mechanization of operations in polynomial algebra has led to the production of programs such as ALPAK, FORMAC, Formula ALGOL (with associated translator), GRAD Assistant and PM. (See the survey in Comm. ACM, Vol. 9, No. 8, August 1966; and Brown, Hyde and Tague, 1962-3, Williams, 1962, and Collins, 1966a.) These programs provide ...
openaire +3 more sources
Polynomiality of surface braid and mapping class group representations [PDF]
, 2023 We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, extending the Lawrence-Bigelow representations of the classical braid groups. These representations naturally come in families,
Soulié, Arthur, Palmer, Martin
core +1 more source