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.
Modular properties of composable term rewriting systems
Enno Ohlebusch
Journal Symbolic Computation
20
(1), 1995, pp. 1-41
Total termination of term rewriting is undecidable
Hans Zantema
Journal Symbolic Computation
20
(1), 1995, pp. 43-60
Computing elements of given index in totally complex cyclic sextic fields
István Gaál
Journal Symbolic Computation
20
(1), 1995, pp. 61-69
On
n
-dimensional sequences - I
Graham Norton
Journal Symbolic Computation
20
(1), 1995, pp. 71-92
On the minimal realizations of a finite sequence
Graham Norton
Journal Symbolic Computation
20
(1), 1995, pp. 93-115
Efficient incremental algorithms for the sparse resultant and the mixed volume
Ioannis Z. Emiris
,
John F. Canny
Journal Symbolic Computation
20
(2), 1995, pp. 117-149
Constructing Carmichael numbers which are strong pseudoprimes to several bases
François Arnault
Journal Symbolic Computation
20
(2), 1995, pp. 151-161
A note on Gröbner bases and integration of rational functions
Günter Czichowski
Journal Symbolic Computation
20
(2), 1995, pp. 163-167
Asymptotic forms and algebraic differential equations
John Shackell
,
Bruno Salvy
Journal Symbolic Computation
20
(2), 1995, pp. 169-177
An algorithm to determine potential systems in mathematica
Gernot Haager
,
Gerd Baumann
,
Theo F. Nonnenmacher
Journal Symbolic Computation
20
(2), 1995, pp. 179-196
Gröbner bases in Clifford and Grassmann algebras
David Hartley
,
Philip Tuckey
Journal Symbolic Computation
20
(2), 1995, pp. 197-205
Linear problems and linear algorithms
B. Curtis Eaves
,
Uriel G. Rothblum
Journal Symbolic Computation
20
(2), 1995, pp. 207-214
Automata for reduction properties solving
Max Dauchet
,
Anne-Cécile Caron
,
Jean-Luc Coquidé
Journal Symbolic Computation
20
(2), 1995, pp. 215-233
Greatest factorial factorization and symbolic summation
Peter Paule
Journal Symbolic Computation
20
(3), 1995, pp. 235-268
Generalized subresultants for computing the Smith normal form of polynomial matrices
Gilles Villard
Journal Symbolic Computation
20
(3), 1995, pp. 269-286
Efficient rational number reconstruction
George E. Collins
,
Mark J. Encarnación
Journal Symbolic Computation
20
(3), 1995, pp. 287-297
Computing GCD's of polynomials over algebraic number fields
Mark J. Encarnación
Journal Symbolic Computation
20
(3), 1995, pp. 299-313
T
-theorem proving I
Alberto Policriti
,
Jacob T. Schwartz
Journal Symbolic Computation
20
(3), 1995, pp. 315-342
The complexity of counting problems in equational matching
Miki Hermann
,
Phokion G. Kolaitis
Journal Symbolic Computation
20
(3), 1995, pp. 343-362
A new polynomial factorization algorithm and its implementation
Victor Shoup
Journal Symbolic Computation
20
(4), 1995, pp. 363-397
Algorithms for
m
-fold hypergeometric summation
Wolfram Koepf
Journal Symbolic Computation
20
(4), 1995, pp. 399-417
Theoretical and experimental comparison of efficiency of finite field extensions
Catherine S. Greenhill
Journal Symbolic Computation
20
(4), 1995, pp. 419-429
Positive and negative results for higher-order disunification
D. Lugiez
Journal Symbolic Computation
20
(4), 1995, pp. 431-470
Reduced idempotents in the semigroup of Boolean matrices
Janusz Konieczny
Journal Symbolic Computation
20
(4), 1995, pp. 471-482
On a conjecture of Peter Borwein
George E. Andrews
Journal Symbolic Computation
20
(5-6), 1995, pp. 487-501
Seiten 1
2
3
>