Polynomial sequences : basic methods, special classes, and computational applications
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783110757231
3110757230
- Dimensions
-
25 cm, 991 g
- Extent
-
XVII, 506 Seiten
- Language
-
Englisch
- Notes
-
Illustrationen
- Bibliographic citation
-
De Gruyter studies in mathematics ; volume 96
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
De Gruyter
- (when)
-
[2024]
- Contributor
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.0002, 12:49 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
Time of origin
- [2024]
Other Objects (12)
Matrix groups and polynomial sequences
Exact smooth piecewise polynomial sequences on Alfeld splits
Counting zero-sum sequences with the polynomial method
Polynomial time partial information classes
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Probabilistic Methods for Computational Annotation of Genomic Sequences
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial kernels for deletion to classes of acyclic digraphs
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Matrix groups and polynomial sequences
Exact smooth piecewise polynomial sequences on Alfeld splits
Counting zero-sum sequences with the polynomial method
Polynomial time partial information classes
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Probabilistic Methods for Computational Annotation of Genomic Sequences
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial kernels for deletion to classes of acyclic digraphs
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Matrix groups and polynomial sequences
Exact smooth piecewise polynomial sequences on Alfeld splits
Counting zero-sum sequences with the polynomial method
Polynomial time partial information classes
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Probabilistic Methods for Computational Annotation of Genomic Sequences
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: Efficient evaluation and estimation of computational models
Polynomial chaos expansion: efficient evaluation and estimation of computational models
Polynomial kernels for deletion to classes of acyclic digraphs