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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing automatic coset systems and subgroup presentations
Derek F. Holt
,
Darren F. Hurt
Journal Symbolic Computation
27
(1), 1999, pp. 1-19
A polynomial time algorithm for diophantine equations in one variable
Felipe Cucker
,
Pascal Koiran
,
Steve Smale
Journal Symbolic Computation
27
(1), 1999, pp. 21-29
SAGBI and SAGBI-Gröbner bases over principal ideal domains
William W. Adams
,
Serkan Hoşten
,
Philippe Loustaunau
,
J. Lyn Miller
Journal Symbolic Computation
27
(1), 1999, pp. 31-47
A unified approach to linear and nonlinear normal forms for Hamiltonian systems
R.C. Churchill
,
Martin Kummer
Journal Symbolic Computation
27
(1), 1999, pp. 49-131
Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra
Susan M. Hermiller
,
Xenia H. Kramer
,
Reinhard C. Laubenbacher
Journal Symbolic Computation
27
(2), 1999, pp. 133-141
Basic algorithms for rational function fields
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
27
(2), 1999, pp. 143-170
An algorithm to calculate optimal homogeneous systems of parameters
Gregor Kemper
Journal Symbolic Computation
27
(2), 1999, pp. 171-184
Lazy linear combinatorial unification
Marco Bellia
,
M. Eugenia Occhiuto
Journal Symbolic Computation
27
(2), 1999, pp. 185-206
The STO problem is
NP
-complete
Piotr Krysta
,
Leszek Pacholski
Journal Symbolic Computation
27
(2), 1999, pp. 207-219
Computer algebra algorithms and routines for the computation of conservation laws and fixing of gauge in differential expressions
Thomas Wolf
,
Andreas Brand
,
Majid Mohammadzadeh
Journal Symbolic Computation
27
(2), 1999, pp. 221-238
Solving difference equations in finite terms
Peter A. Hendriks
,
Michael F. Singer
Journal Symbolic Computation
27
(3), 1999, pp. 239-259
On polynomial decompositions
Jürgen Klüners
Journal Symbolic Computation
27
(3), 1999, pp. 261-269
A framework for operational equational specifications with pre-defined structures
Jürgen Avenhaus
,
Klaus Becker
Journal Symbolic Computation
27
(3), 1999, pp. 271-310
A transducer approach to Coxeter groups
Fokko du Cloux
Journal Symbolic Computation
27
(3), 1999, pp. 311-324
On shortest linear recurrences
Graham H. Norton
Journal Symbolic Computation
27
(3), 1999, pp. 325-349
Computing toric ideals
Anna Maria Bigatti
,
Robertola Scala
,
Lorenzo Robbiano
Journal Symbolic Computation
27
(4), 1999, pp. 351-365
Factors of iterated resultants and discriminants
Scott McCallum
Journal Symbolic Computation
27
(4), 1999, pp. 367-385
Construction of finite groups
Hans Ulrich Besche
,
Bettina Eick
Journal Symbolic Computation
27
(4), 1999, pp. 387-404
The groups of order at most 1000 except 512 and 768
Hans Ulrich Besche
,
Bettina Eick
Journal Symbolic Computation
27
(4), 1999, pp. 405-413
Computing subgroups invariant under a set of automorphisms
Alexander Hulpke
Journal Symbolic Computation
27
(4), 1999, pp. 415-427
Sheaf cohomology is
\#P
-hard
Eric Bach
Journal Symbolic Computation
27
(4), 1999, pp. 429-433
A categorical critical-pair completion algorithm
Karel Stokkermans
Journal Symbolic Computation
27
(5), 1999, pp. 435-477
A computational method for determining strong stabilizability of
n
-D systems
Jiang Qian Ying
,
Li Xu
,
Zhiping Lin
Journal Symbolic Computation
27
(5), 1999, pp. 479-499
Integrating factors for second-order ODEs
E.S. Chep-Terrab
,
A.D. Roche
Journal Symbolic Computation
27
(5), 1999, pp. 501-519
The Pohlig-Hellman method generalized for group structure computation
Edlyn Teske
Journal Symbolic Computation
27
(6), 1999, pp. 521-534
Seiten 1
2
>