An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (Q2944555): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SumCracker / rank | |||
Normal rank | |||
Revision as of 19:38, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for deciding zero equivalence of nested polynomially recurrent sequences |
scientific article |
Statements
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (English)
0 references
2 September 2015
0 references
symbolic computation
0 references
combinatorial sequences
0 references
nested polynomially recurrent sequences
0 references
zero equivalence
0 references
