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 YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Visualization of mathematical surfaces: The IZIG server approach
Robert Fournier
,
Norbert Kajler
,
Bernard Mourrain
Journal Symbolic Computation
19
(1-3), 1995, pp. 159-173
A sequent calculus for automated reasoning in symbolic computation systems
Gianna Cioni
,
Attilio Colagrossi
,
Alfonso Miola
Journal Symbolic Computation
19
(1-3), 1995, pp. 175-199
Contexts in mathematical reasoning and computation
William M. Farmer
,
Joshua D. Guttman
,
F. Javier Thayer
Journal Symbolic Computation
19
(1-3), 1995, pp. 201-216
A generic graphic framework for combining inference tools and editing proofs and formulae
Ricardo Caferra
,
Michel Herment Lifia-Imag
Journal Symbolic Computation
19
(1-3), 1995, pp. 217-243
Distributed deduction by Clause-diffusion: Distributed contraction and the Aquarius prover
Maria Paola Bonacina
,
Jieh Hsiang
Journal Symbolic Computation
19
(1-3), 1995, pp. 245-267
Process scheduling in DSC and the large sparse linear systems challenge
A. Díaz
,
M. Hitz
,
E. Kaltofen
,
A. Lobo
,
T. Valente
Journal Symbolic Computation
19
(1-3), 1995, pp. 269-282
Computing bases for rings of permutation-invariant polynomials
Manfred Göbel
Journal Symbolic Computation
19
(4), 1995, pp. 285-291
The summation of rational functions by an extended Gosper algorithm
D.E.G. Malm
,
T.N. Subramaniam
Journal Symbolic Computation
19
(4), 1995, pp. 293-304
A deterministic construction of normal bases with complexity
O(n^3+n\log n\log(\log n)\log q)
Alain Poli
Journal Symbolic Computation
19
(4), 1995, pp. 305-319
Theorem proving with ordering and equality constrained clauses
Robert Nieuwenhuis
,
Albert Rubio
Journal Symbolic Computation
19
(4), 1995, pp. 321-351
Resolution-based theorem proving for many-valued logics
Matthias Baaz
,
Christian G. Fermüller
Journal Symbolic Computation
19
(4), 1995, pp. 353-391
Fraction free Gaussian elimination for sparse matrices
Hong R. Lee
,
B. David Saunders
Journal Symbolic Computation
19
(5), 1995, pp. 393-402
Coefficient fields of solutions in Kovacic's algorithm
Alexey Zharkov
Journal Symbolic Computation
19
(5), 1995, pp. 403-408
Homogeneous bivariate decompositions
Joachim von zur Gathen
,
Jürgen Weiss
Journal Symbolic Computation
19
(5), 1995, pp. 409-434
Factorization of prime ideal extensions in Dedekind Domains
Ilaria del Corso
Journal Symbolic Computation
19
(5), 1995, pp. 435-439
A Gröbner approach to involutive bases
Joachim Apel
Journal Symbolic Computation
19
(5), 1995, pp. 441-457
The Todd-Coxeter procedure and left Kan extensions
S. Carmody
,
M. Leeming
,
R.F.C. Walters
Journal Symbolic Computation
19
(5), 1995, pp. 459-488
Perfect bases for equational theories
Jaroslav Jez̑ek
,
George F. McNulty
Journal Symbolic Computation
19
(5), 1995, pp. 489-505
A fast method for finding the basis of non-negative solutions to a linear diophantine equation
Miguel Filgueiras
,
Ana Paula Tomás
Journal Symbolic Computation
19
(6), 1995, pp. 507-526
A rational function decomposition algorithm by near-separated polynomials
Cesar Alonso
,
Jaime Gutierrez
,
Tomas Recio
Journal Symbolic Computation
19
(6), 1995, pp. 527-544
Algorithms in local algebra
Hans-Gert Gräbe
Journal Symbolic Computation
19
(6), 1995, pp. 545-557
Galois action on solutions of a differential equation
Peter A. Hendriks
,
Marius van der Put
Journal Symbolic Computation
19
(6), 1995, pp. 559-576
Selecting base points for the Schreier-Sims algorithm for matrix groups
Scott H. Murray
,
E.A. O'Brien
Journal Symbolic Computation
19
(6), 1995, pp. 577-584
The 2-modular decomposition matrices of the non-principal blocks of maximal defect of the triple cover of the sporadic simple McLaughlin group
Gerhard Hiss
,
Klaus Lux
,
Jürgen Müller
Journal Symbolic Computation
19
(6), 1995, pp. 585-600
Confluence of curried term-rewriting systems
Stefan Kahrs
Journal Symbolic Computation
19
(6), 1995, pp. 601-623
Seiten
<
1
2
3