An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (Q2944555): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FGb / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SumCracker / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GeneratingFunctions / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1240233.1240241 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065374506 / rank | |||
Normal rank | |||
Latest revision as of 18:59, 19 March 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
