Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Symbolic Computation AND Volume=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-commutative Gröbner bases in algebras of solvable type
A. Kandri-Rody
,
V. Weispfenning
Journal Symbolic Computation
9
(1), 1990, pp. 1-26
An Algorithm for the construction of Matrix representations for finitely presented non-commutative algebras
Gilles Labonté
Journal Symbolic Computation
9
(1), 1990, pp. 27-38
Operation of class sums on permutation modules
H.W. Gollan
,
T.W. Ostermann
Journal Symbolic Computation
9
(1), 1990, pp. 39-47
The transcendental Risch differential equation
Manuel Bronstein
Journal Symbolic Computation
9
(1), 1990, pp. 49-60
Renormalisation group, function iterations and computer algebra
H. Caprasse
Journal Symbolic Computation
9
(1), 1990, pp. 61-72
The analytic approach to recursion relations
S.A. Fulling
Journal Symbolic Computation
9
(1), 1990, pp. 73-85
Computer-aided study of a problem in Hermitian matrix theory
Man Kam Kwong
,
Mary Beth Dever
Journal Symbolic Computation
9
(1), 1990, pp. 87-112
Integration of rational functions: Rational computation of the logarithmic part
D. Lazard
,
R. Rioboo
Journal Symbolic Computation
9
(2), 1990, pp. 113-115
Integration of elementary functions
Manuel Bronstein
Journal Symbolic Computation
9
(2), 1990, pp. 117-173
Inversion in finite fields using logarithmic depth
Joachim von zur Gathen
Journal Symbolic Computation
9
(2), 1990, pp. 175-183
An incremental method for generating prime implicants/implicates
Alex Kean
,
George Tsiknis
Journal Symbolic Computation
9
(2), 1990, pp. 185-206
Application of symbolic algebra to the analysis of plates on variable elastic foundation
Moshe Eisenberger
Journal Symbolic Computation
9
(2), 1990, pp. 207-213
REDUCE and the bifurcation of limit cycles
N.G. LLoyd
,
J.M. Pearson
Journal Symbolic Computation
9
(2), 1990, pp. 215-224
Factoring polynomials using fewer random bits
Eric Bach
,
Victor Shoup
Journal Symbolic Computation
9
(3), 1990, pp. 229-239
Generalised characteristic polynomials
John Canny
Journal Symbolic Computation
9
(3), 1990, pp. 241-250
Matrix multiplication via arithmetic progressions
Don Coppersmith
,
Shmuel Winograd
Journal Symbolic Computation
9
(3), 1990, pp. 251-280
Functional decomposition of polynomials: The tame case
Joachim von zur Gathen
Journal Symbolic Computation
9
(3), 1990, pp. 281-299
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
Erich Kaltofen
,
Barry M. Trager
Journal Symbolic Computation
9
(3), 1990, pp. 301-320
Shortest division chains in imaginary quadratic number fields
Heinrich Rolletschek
Journal Symbolic Computation
9
(3), 1990, pp. 321-354
Computing the structure of finite algebras
Lajos Rónyai
Journal Symbolic Computation
9
(3), 1990, pp. 355-373
Interpolating polynomials from their values
Richard Zippel
Journal Symbolic Computation
9
(3), 1990, pp. 375-403
Singular points of algebraic curves
Takis Sakkalis
,
Rida Farouki
Journal Symbolic Computation
9
(4), 1990, pp. 405-421
Automated proof of ring commutativity problems by algebraic methods
Hantao Zhang
Journal Symbolic Computation
9
(4), 1990, pp. 423-427
Analysis of Euclidean algorithms for polynomials over finite fields
Keju Ma
,
Joachim von zur Gathen
Journal Symbolic Computation
9
(4), 1990, pp. 429-455
Minimum
k
-partitioning of rectilinear polygons
Oliver Günther
Journal Symbolic Computation
9
(4), 1990, pp. 457-483
Seiten 1
2
>