Search Results - "68W30 Symbolic computation and algebraic computation"

Construction of an endgame rulebook for Sylver Coinage using trees of numerical semigroups by Bras-Amorós, Maria, Moskowitz, Gilad, Ponomarenko, Vadim

“…In this paper we show how the algorithms to explore the tree of numerical semigroups can be used to calculate the winningness of positions in the game of…”
Get full text

Linear programming using limited-precision oracles by Gleixner, Ambros, Steffy, Daniel E.

“…Since the elimination algorithm of Fourier and Motzkin, many different methods have been developed for solving linear programs. When analyzing the time…”
Get full text

Using Machine Learning to Improve Cylindrical Algebraic Decomposition by Huang, Zongyan, England, Matthew, Wilson, David J., Bridge, James, Davenport, James H., Paulson, Lawrence C.

“…Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over…”
Get full text

Strassen’s 2×2 matrix multiplication algorithm: a conceptual perspective by Ikenmeyer, Christian, Lysikov, Vladimir

“…The main purpose of this paper is pedagogical. Despite its importance, all proofs of the correctness of Strassen’s famous 1969 algorithm to multiply two 2 × 2…”
Get full text

Cylindrical Algebraic Sub-Decompositions by Wilson, D. J., Bradford, R. J., Davenport, J. H., England, M.

“…Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying…”
Get full text