Results 11 to 20 of about 94,123 (313)
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
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 +2 more sources
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
Discussiones Mathematicae Graph Theory, 2020 In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj +1 more source
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
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 +4 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 +2 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 +2 more sources
Equitable colorings of ��-corona products of cubic graphs [PDF]
Archives of Control SciencesA graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one.
Hanna Furmańczyk, Marek Kubale
doaj +1 more source
The Extension of the GVW Algorithm to Valuation Domains
Complexity, 2021 The GVW algorithm is an effective algorithm to compute Gröbner bases for polynomial ideals over a field. Combined with properties of valuation domains and the idea of the GVW algorithm, we propose a new algorithm to compute Gröbner bases for polynomial ...
Dongmei Li, Licui Zheng
doaj +1 more source
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, Steven, S. D. Noble, Noble, S D
core +1 more source