Results 21 to 30 of about 40,126 (265)
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
Polynomial decomposition algorithms
Journal of Symbolic Computation, 1985 \textit{M. Fried} and \textit{R. MacRae} [Math. Ann. 180, 220--226 (1969; Zbl 0185.28803)] proved the following theorem: Let \(f,g,p,q\) be univariate polynomials over an arbitrary field \(k\). Then \(p(x)-q(z)\) divides \(f(x)-g(z)\) if and only if there exists a polynomial \(F(t)\) over \(k\) such that \(f(t)=F(p(t))\) and \(g(t)=F(q(t)).\) The ...
David R. Barton, Richard Zippel
openaire +2 more sources
Polynomial decomposition algorithms
Journal of Symbolic Computation, 1989 A polynomial \(f\) over a commutative ring is said to be decomposable if it has a non-trivial functional decomposition \(f=g\circ h\). Previous algorithms to check decomposability were exponential-time in the worst case and only worked over fields of characteristic 0.
Dexter Kozen, Susan Landau 0001
openaire +3 more sources
Algorithmic Computation of Polynomial Amoebas [PDF]
, 2016 We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation of~polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope ...
D. V. Bogdanov +2 more
openaire +5 more sources
Division algorithms for Bernstein polynomials [PDF]
Computer Aided Geometric Design, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Busé, Laurent, Goldman, Ron
openaire +1 more source
Bus Scheduling as a Graph Coloring Problem
Communications, 2003 The fundamental vehicle-scheduling problem (VSP) is usually formulated as a matching problem for which there exists a polynomial algorithm. The formulation of VSP as a graph coloring problem may seem not to be practical since a graph coloring problem is ...
Stanislav Paluch
doaj +1 more source
Determination of the normalization level of database schemas through equivalence classes of attributes [PDF]
Computer Science Journal of Moldova, 2009 In this paper, based on equivalence classes of attributes there are formulated necessary and sufficient conditions that constraint a database schema to be in the second, third or Boyce-Codd normal forms. These conditions offer a polynomial complexity for
Cotelea Vitalie
doaj
A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings
Open Mathematics, 2015 Signature-based algorithms are efficient algorithms for computing Gröbner-Shirshov bases in commutative polynomial rings, and some noncommutative rings. In this paper, we first define skew solvable polynomial rings, which are generalizations of solvable ...
Zhao Xiangui, Zhang Yang
doaj +1 more source
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source
Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials
IEEE Access, 2023 Discrete Racah polynomials (DRPs) are highly efficient orthogonal polynomials and used in various scientific fields for signal representation. They find applications in disciplines like image processing and computer vision.
Basheera M. Mahmmod +4 more
doaj +1 more source