-
3
-
-
85025514453
-
A critical-pair completion algorithm for finitely generated ideals in rings
-
Symposium Rekursive Kombinatorik, Münster (FRG). Number 171 Springer-Verlag
-
Buchberger, B. (1984). A critical-pair completion algorithm for finitely generated ideals in rings. In: Symposium Rekursive Kombinatorik, Münster (FRG). In: Lectures Notes in Computer Science. Number 171 Springer-Verlag. pp. 137-161.
-
(1984)
Lectures Notes in Computer Science
, pp. 137-161
-
-
Buchberger, B.1
-
4
-
-
0002803133
-
Gröbner bases: An algorithmic method in polynomial ideal theory
-
(N. K. Bose, Ed.). D. Reidel
-
Buchberger, B. (1985). Gröbner bases: An algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory (N. K. Bose, Ed.). pp. 184-232. D. Reidel.
-
(1985)
Multidimensional Systems Theory
, pp. 184-232
-
-
Buchberger, B.1
-
5
-
-
0026825879
-
Exact modelling and identifiability of linear systems
-
Heij, C. (1992). Exact modelling and identifiability of linear systems. Automatica 28, 325-344.
-
(1992)
Automatica
, vol.28
, pp. 325-344
-
-
Heij, C.1
-
6
-
-
0003034426
-
Multidimensional constant linear systems
-
Oberst, U. (1990). Multidimensional constant linear systems. Acta Applicandae Mathematicae 20, 1-175.
-
(1990)
Acta Applicandae Mathematicae
, vol.20
, pp. 1-175
-
-
Oberst, U.1
-
7
-
-
0027740705
-
On the minimal number of trajectories determining a multidimensional system
-
Oberst, U. (1993). On the minimal number of trajectories determining a multidimensional system. Math. of Control, Signals, and Systems 6, 264-288.
-
(1993)
Math. of Control, Signals, and Systems
, vol.6
, pp. 264-288
-
-
Oberst, U.1
-
8
-
-
0011403824
-
Gröbner basen und ihre Anwendungen
-
(S. Chatterji et al., Ed.). Vieweg Verlag
-
Pauer, F. (1991). Gröbner Basen und ihre Anwendungen. In: Jahrbuch Überblicke Mathematik (S. Chatterji et al., Ed.). pp. 127-149. Vieweg Verlag.
-
(1991)
Jahrbuch Überblicke Mathematik
, pp. 127-149
-
-
Pauer, F.1
-
10
-
-
33747274267
-
Finding a minimal set of linear recurring relations capable of generating a given two-dimensinal array
-
Sakata, S. (1988). Finding a minimal set of linear recurring relations capable of generating a given two-dimensinal array. J. Symbolic Computation 5, 321-337.
-
(1988)
J. Symbolic Computation
, vol.5
, pp. 321-337
-
-
Sakata, S.1
-
11
-
-
84978911439
-
A generalization of reduction rings
-
Stifter, S. (1988). A generalization of reduction rings. Journal of Symbolic Computation 4, 351-364.
-
(1988)
Journal of Symbolic Computation
, vol.4
, pp. 351-364
-
-
Stifter, S.1
-
12
-
-
0022775849
-
From time series to linear system, part I: Finite dimensional linear time invariant systems
-
Willems, J.C. (1986). From time series to linear system, part I: Finite dimensional linear time invariant systems. Automatica 22, 561-580.
-
(1986)
Automatica
, vol.22
, pp. 561-580
-
-
Willems, J.C.1
-
13
-
-
0011453451
-
Exact modelling of scalar 2D arrays
-
Zampieri, S. (1994). Exact modelling of scalar 2D arrays. Kybernetica 30, 129-140.
-
(1994)
Kybernetica
, vol.30
, pp. 129-140
-
-
Zampieri, S.1
|