Results 241 to 250 of about 2,555,427 (286)
Quantum algorithms for equational reasoning. [PDF]
Sci AdvRattacaso D +4 more
europepmc +1 more source
Large-scale semidefinite programming with graphics processing units. [PDF]
Proc Natl Acad Sci U S AHan Q +6 more
europepmc +1 more source
A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games
, 2008 Munoz de Cote, Enrique +1 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Messaoudi +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Messaoudi +2 more
openaire +3 more sources
A polynomial decomposition algorithm
Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) = g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.
David R. Barton, Richard E. Zippel
openaire +1 more source
Extended polynomial algorithms
Proceedings of the annual conference on - ACM'73, 1973It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
Anthony C. Hearn, Rüdiger G. K. Loos
openaire +2 more sources
Algorithms for symmetrical polynomials
Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976A special representation for symmetrical polynomials is introduced. Algorithms for the ring operations and for several versions of Gauss' method to express an arbitrary symmetrical polynomial by the elementary symmetrical functions are given and analyzed. Empirical observations show that the representation which is the most economical in terms of space
openaire +2 more sources
A polynomial algorithm for partitioning problems
ACM Transactions on Embedded Computing Systems, 2010This article takes a theoretical approach to focus on the algorithmic properties of hardware/software partitioning. It proposes a method with polynomial complexity to find the global optimum of an NP-hard model partitioning problem for 75% of occurrences under some practical conditions.
Seyed-Abdoreza Tahaee +1 more
openaire +1 more source