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=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Testing polynomials
Jean-Jaques Risler
,
Felice Ronga
Journal Symbolic Computation
10
, 1990, pp. 1-5
Complexity of factoring and calculating the GCD of linear ordinary differential operators
D.Yu. Grigor'ev
Journal Symbolic Computation
10
, 1990, pp. 7-37
Complexity of computation on real algebraic numbers
Marie-Françoise Roy
,
Aviva Szpirglas
Journal Symbolic Computation
10
, 1990, pp. 39-51
On the asymptotic analysis of the Euclidean algorithm
G.H. Norton
Journal Symbolic Computation
10
, 1990, pp. 53-58
Formal solutions of differential equations
Michael F. Singer
Journal Symbolic Computation
10
, 1990, pp. 59-94
The
(n^2-1)
-puzzle and related relocation problems
Daniel Ratner
,
Manfred Warmuth
Journal Symbolic Computation
10
, 1990, pp. 111-137
Power series remainder sequences and and Padé fractions over an integral domain
S. Cabay
,
P. Kossowski
Journal Symbolic Computation
10
, 1990, pp. 139-163
Standard bases and some computations in rings of power series
Thomas Becker
Journal Symbolic Computation
10
, 1990, pp. 165-178
Processing poisson series in parallel
André Deprit
,
Etienne Deprit
Journal Symbolic Computation
10
, 1990, pp. 179-201
Computer classification of integrable coupled KdV-like systems
V.P. Gerdt
,
A.Yu. Zharkov
Journal Symbolic Computation
10
, 1990, pp. 203-207
Some remarks on numerical iterations in a symbolic manipulation system
Aik-Koan Heng
Journal Symbolic Computation
10
, 1990, pp. 209-221
Non-convex contour reconstruction
P. Alevizos
,
J.D. Boissonnat
,
M. Yvinec
Journal Symbolic Computation
10
, 1990, pp. 225-252
A fast planar partition algorithm, I
Ketan Mulmuley
Journal Symbolic Computation
10
, 1990, pp. 253-280
An algorithm for generalized point location and its applications
Bernard Chazelle
,
Micha Sharir
Journal Symbolic Computation
10
, 1990, pp. 281-309
Locating a robot with angle measurements
David Avis
,
Hiroshi Imai
Journal Symbolic Computation
10
, 1990, pp. 311-326
On the complexity of some geometric problems in unbounded dimension
Nimrod Megiddo
Journal Symbolic Computation
10
, 1990, pp. 327-334
Tetrahedrizing point sets in three dimensions
H. Edelsbrunner
,
F.P. Preparata
,
D.B. West
Journal Symbolic Computation
10
, 1990, pp. 335-347
Symbolic treatment of geometric degeneracies
Chee-Keng Yap
Journal Symbolic Computation
10
, 1990, pp. 349-370
On the two-dimensional Davenport-Schinzel problem
Jacob T. Schwartz
,
Micha Sharir
Journal Symbolic Computation
10
, 1990, pp. 371-393
The complexity of almost linear diophantine problems
V. Weispfenning
Journal Symbolic Computation
10
, 1990, pp. 395-403
A theorem on random polynomials and some consequences in average complexity
F. Cucker
,
M.-F. Roy
Journal Symbolic Computation
10
, 1990, pp. 405-409
The complexity of equivalence for commutative rings
H.B. Hunt III
,
R.E. Stearns
Journal Symbolic Computation
10
, 1990, pp. 411-436
Functional decomposition of polynomials: The wild case
Joachim von zur Gathen
Journal Symbolic Computation
10
, 1990, pp. 437-452
On
p
-adic computation of the rational form of a matrix
Marie-Hélène Mathieu
,
David Ford
Journal Symbolic Computation
10
, 1990, pp. 453-464
The concept of Gröbner algebras
P. Beckmann
,
J. Stückrad
Journal Symbolic Computation
10
, 1990, pp. 465-479
Seiten 1
2
3
4
>