default search action

combined dblp search
author search
venue search
publication search

ask others

Journal of Symbolic Computation, Volume 117

> Home > Journals > Journal of Symbolic Computation

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 117, July 2023

- view
  authority control:
- export record
  dblp key:
  - journals/jsc/HashemiM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/HashemiM23
Amir Hashemi, H. Michael Möller:
A new algorithm for computing staggered linear bases. 1-14
- view
  authority control:
- export record
  dblp key:
  - journals/jsc/JimenezPastorP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/JimenezPastorP23
Antonio Jiménez-Pastor, Marko Petkovsek:
The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients. 15-50
- view
  authority control:
- export record
  dblp key:
  - journals/jsc/Lubeck23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/Lubeck23
Frank Lübeck:
Standard generators of finite fields and their cyclic subgroups. 51-67
- view
  authority control:
- export record
  dblp key:
  - journals/jsc/Eid23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/Eid23
Elie Eid:
Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields. 68-100
- view
  authority control:
- export record
  dblp key:
  - journals/jsc/AkogluS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/AkogluS23
Tulay Ayyildiz Akoglu, Ágnes Szántó:
Certified Hermite matrices from approximate roots. 101-118

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.