An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/Kauers07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/Kauers07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Manuel_Kauers
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1240233.1240241
>
foaf:
homepage
<
https://doi.org/10.1145/1240233.1240241
>
dc:
identifier
DBLP journals/talg/Kauers07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1240233.1240241
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Manuel_Kauers
>
swrc:
number
2
(xsd:string)
swrc:
pages
18
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/Kauers07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/Kauers07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg3.html#Kauers07
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1240233.1240241
>
dc:
subject
Symbolic computation, combinatorial sequences, nested polynomially recurrent sequences, zero equivalence
(xsd:string)
dc:
title
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
3
(xsd:string)