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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants
Henk Barendregt
,
Arjeh M. Cohen
Journal Symbolic Computation
32
(1-2), 2001, pp. 3-22
Algorithms for finite near-rings and their
N
-groups
Franz Binder
,
Peter Mayr
Journal Symbolic Computation
32
(1-2), 2001, pp. 23-38
Two computational techniques for singularity resolution
Gábor Bodnár
,
Josef Schicho
Journal Symbolic Computation
32
(1-2), 2001, pp. 39-54
Formal and efficient primality proofs by use of computer algebra oracles
Olga Caprotti
,
Martijn Oostdijk
Journal Symbolic Computation
32
(1-2), 2001, pp. 55-70
On efficient sparse integer matrix Smith normal form computations
Jean-Guillaume Dumas
,
B. David Saunders
,
Gilles Villard
Journal Symbolic Computation
32
(1-2), 2001, pp. 71-99
Constructing homomorphism spaces and endomorphism rings
Edward L. Green
,
Lenwood S. Heath
,
Craig A. Struble
Journal Symbolic Computation
32
(1-2), 2001, pp. 101-117
The parametrization of canal surfaces and the decomposition of polynomials into a sum of two squares
Günter Landsmann
,
Josef Schicho
,
Franz Winkler
Journal Symbolic Computation
32
(1-2), 2001, pp. 119-132
Computing isomorphisms of association schemes and its application
Izumi Miyamoto
Journal Symbolic Computation
32
(1-2), 2001, pp. 133-141
Commutative algebra in the Mizar system
Piotr Rudnicki
,
Christoph Schwarzweller
,
Andrzej Trybulec
Journal Symbolic Computation
32
(1-2), 2001, pp. 143-169
Counting points on curves and Abelian varieties over finite fields
Leonard M. Adleman
,
Ming-Deh Huang
Journal Symbolic Computation
32
(3), 2001, pp. 171-189
Squarefree decomposition of univariate polynomials depending on a parameter - Application to the integration of parametric rational functions
Gema M. Diaz-Toca
,
Laureano Gonzalez-Vega
Journal Symbolic Computation
32
(3), 2001, pp. 191-209
Computing local integral closures
Emmanuel Hallouin
Journal Symbolic Computation
32
(3), 2001, pp. 211-230
Symbolic reachability computation for families of linear vector fields
Gerardo Lafferriere
,
George J. Pappas
,
Sergio Yovine
Journal Symbolic Computation
32
(3), 2001, pp. 231-253
Constructing irreducible representations of finitely presented algebras
Edward S. Letzter
Journal Symbolic Computation
32
(3), 2001, pp. 255-262
Computing the radical of an ideal in positive characteristic
Ryutaroh Matsumoto
Journal Symbolic Computation
32
(3), 2001, pp. 263-271
Condensation of symmetrized tensor powers
A.J.E. Ryba
Journal Symbolic Computation
32
(3), 2001, pp. 273-289
Solving the word problem for two classes of non-associative rings by rewriting
Alfred Widiger
Journal Symbolic Computation
32
(3), 2001, pp. 291-301
The control layer in open mechanized reasoning systems: Annotations and tactics
Alessandro Armando
,
Alessandro Coglio
,
Fausto Giunchiglia
,
Silvio Ranise
Journal Symbolic Computation
32
(4), 2001, pp. 305-332
Automatic derivation of the irrationality of
e
Michael Beeson
Journal Symbolic Computation
32
(4), 2001, pp. 333-349
On the role of OpenMath in interactive mathematical documents
O. Caprotti
,
A.M. Cohen
Journal Symbolic Computation
32
(4), 2001, pp. 351-364
MBase: Representing knowledge and context for the integration of mathematical sofware systems
Michael Kohlhase
,
Andreas Franke
Journal Symbolic Computation
32
(4), 2001, pp. 365-402
A general framework to build contextual cover set induction provers
Sorin Stratulat
Journal Symbolic Computation
32
(4), 2001, pp. 403-445
Improved projection for cylindrical algebraic decomposition
Christopher W. Brown
Journal Symbolic Computation
32
(5), 2001, pp. 447-465
Polynomial minimum root separation
George E. Collins
Journal Symbolic Computation
32
(5), 2001, pp. 467-473
Computing with quantized enveloping algebras: PBW-type bases, highest-weight modules and
R
-matrices
W.A. de Graaf
Journal Symbolic Computation
32
(5), 2001, pp. 475-490
Seiten 1
2
>