Approach to the construction of algebraic models of algorithms and programs
β Scribed by S. V. Surzhko; E. L. Yushchenko
- Publisher
- Springer US
- Year
- 1996
- Tongue
- English
- Weight
- 587 KB
- Volume
- 32
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computer algebra and in particular GrΓΆbner bases are powerful tools in experimental design (Pistone and Wynn, 1996, Biometrika 83, 653-666). This paper applies this algebraic methodology to the identifiability of Fourier models. The choice of the class of trigonometric models forces one to deal with
The trie, or digital tree, is a standard data structure for representing sets of strings over a given finite alphabet. Since Knuth's original work (1973), these data structures have been extensively studied and analyzed. In this paper, we present an algebraic approach to the analysis of average stor