


default search action
Journal of Symbolic Computation, Volume 87
Volume 87, July-August 2018
- Jie Wang:

Difference indices of quasi-prime difference algebraic systems. 1-13 - Gabriela Jeronimo, Juan Sabia:

Sparse resultants and straight-line programs. 14-27 - Douglas Navarro Guevara

:
Primitive transcendental functions and symbolic computation. 28-53 - Bo Lin

:
Computing linear systems on metric graphs. 54-67 - Michael Hauer, Bert Jüttler

:
Projective and affine symmetries and equivalences of rational curves in arbitrary dimension. 68-86 - Maria-Laura Torrente

, Matteo Varbaro:
Computing the Betti table of a monomial ideal: A reduction algorithm. 87-98 - Nathan Fox

:
Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation. 99-126 - Thieu N. Vo

, Georg Grasegger
, Franz Winkler:
Deciding the existence of rational general solutions for first-order algebraic ODEs. 127-139 - Hayden Stainsby:

Triangular bases of integral closures. 140-175 - Mohab Safey El Din, Éric Schost:

Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. 176-206 - Ming-Deh A. Huang, Michiel Kosters, Yun Yang, Sze Ling Yeo:

On the last fall degree of zero-dimensional Weil descent systems. 207-226 - Alex Massarenti, Massimiliano Mella

, Giovanni Staglianò:
Effective identifiability criteria for tensors and polynomials. 227-237 - Przemyslaw Koprowski

, Kurt Mehlhorn, Saurabh Ray:
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. 238-241

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














