default search action
Journal of Symbolic Computation, Volume 105
Volume 105, July 2021
- Erich L. Kaltofen
:
Foreword. 1-3 - Kosaku Nagasaka:
Toward the best algorithm for approximate GCD of univariate polynomials. 4-27 - Jiaxiong Hu, Michael B. Monagan:
A fast parallel sparse polynomial GCD algorithm. 28-63 - Jaime Gutierrez
On some classes of irreducible polynomials. 64-70 - Matías R. Bender
A nearly optimal algorithm to decompose binary forms. 71-96 - Robert H. C. Moir, Robert M. Corless
An unwinding number pair for continuous expressions of integrals. 97-117 - Daniel Lichtblau:
Symbolic analysis of multiple steady states in a MAPK chemical reaction network. 118-144 - Ioannis Z. Emiris
Multilinear polynomial systems: Root isolation and bit complexity. 145-164 - David Lucas, Vincent Neiger
Verification protocols with sub-linear communication for polynomial matrix operations. 165-198 - Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. 199-213 - Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. 214-233
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.
last updated on 2024-12-19 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: