default search action
Journal of Symbolic Computation, Volume 92
Volume 92, May 2019
- Ivan Marin:
Proof of the BMR conjecture for G20 and G21. 1-14 - Jinwang Liu, Dongmei Li, Weijun Liu:
Some criteria for Gröbner bases and their applications. 15-21 - Rok Pozar:
Computing stable epimorphisms onto finite groups. 22-30 - Adam W. Strzebonski, Elias P. Tsigaridas:
Univariate real root isolation in an extension field and applications. 31-51 - Scott McCallum, Adam Parusinski, Laurentiu Paunescu:
Validity proof of Lazard's method for CAD construction. 52-69 - Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker:
New refiners for permutation group search. 70-92 - Maria Alberich-Carramiñana, Josep Àlvarez Montaner, Guillem Blanco:
Effective computation of base points of ideals in two-dimensional local rings. 93-109 - James East, Attila Egri-Nagy, James D. Mitchell, Yann H. Péresse:
Computing finite semigroups. 110-155 - Markus Rosenkranz, Nitin Serwa:
An integro-differential structure for Dirac distributions. 156-189 - Zijia Li, Josef Schicho, Hans-Peter Schröcker:
Factorization of motion polynomials. 190-202 - Alexander Cant, Bettina Eick:
Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups. 203-210 - Julien Chien, Sam Nelson:
Virtual links with finite medial bikei. 211-221 - Carlos Améndola, Nathan Bliss, Isaac Burke, Courtney R. Gibbons, Martin Helmer, Serkan Hosten, Evan D. Nash, Jose Israel Rodriguez, Daniel Smolkin:
The maximum likelihood degree of toric varieties. 222-242 - Grégoire Lecerf:
On the complexity of the Lickteig-Roy subresultant algorithm. 243-268 - José Gómez-Torrecillas, Francisco Javier Lobillo, Gabriel Navarro:
Computing the bound of an Ore polynomial. Applications to factorization. 269-297
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.