Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=358

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

On the computational complexity of the resolution of plane curve singularities
J. Teitelbaum
Lecture Notes in Computer Science 358, 1989, pp. 285-292
Genralized characteristic polynomials
J. Canny
Lecture Notes in Computer Science 358, 1989, pp. 293-299
Decomposition of algebras
P. Gianni, V. Miller, B. Trager
Lecture Notes in Computer Science 358, 1989, pp. 300-308
Algebraic transformations of polynomial equations, symmetric polynomials and elimination
M. Giusti, D. Lazard, A. Valibouze
Lecture Notes in Computer Science 358, 1989, pp. 309-315
Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F.P. Preparata, D.B. West
Lecture Notes in Computer Science 358, 1989, pp. 315-331
A generalization of the Roider method to solve the robot collision problem in 3D
S. Stifter
Lecture Notes in Computer Science 358, 1989, pp. 332-343
Symbolic analysis of planar drawings
P.H. Todd, G.W. Cherry
Lecture Notes in Computer Science 358, 1989, pp. 344-355
A geometrical decision algorithm based on the Gröbner bases algorithm
F. Winkler
Lecture Notes in Computer Science 358, 1989, pp. 356-363
Solving permutation problems using rewriting systems
C. Brown, G. Cooperman, L. Finkelstein
Lecture Notes in Computer Science 358, 1989, pp. 364-377
Applying rewriting techniques to groups with power-commutation-presentations
D. Wissmann
Lecture Notes in Computer Science 358, 1989, pp. 378-389
Efficient decision procedures for locally finite theories II
V. Weispfenning
Lecture Notes in Computer Science 358, 1989, pp. 390-401
A formal approach to some usually informal techniques used in mathematical reasoning
T. Boy de la Tour, R. Caferra
Lecture Notes in Computer Science 358, 1989, pp. 402-406
Decision procedures for elementary sublanguages of set theory. XIV: Three languages involving rank related constructs
D. Cantone, V. Cutello, A. Ferro
Lecture Notes in Computer Science 358, 1989, pp. 407-422
Computer algebra on MIMD machine
J.L. Roch, P. Senechaud, F. Siebert-Roch, G. Villard
Lecture Notes in Computer Science 358, 1989, pp. 423-439
Algebraic extensions and algebraic closure in SCRATCHPAD II
C. Dicrescenzo, D. Duval
Lecture Notes in Computer Science 358, 1989, pp. 440-446
Software development for computer algebra
H. Kredel
Lecture Notes in Computer Science 358, 1989, pp. 447-455
Cayley, Version 4: The user language
G. Butler, J. Cannon
Lecture Notes in Computer Science 358, 1989, pp. 456-466
Improved sparse multivariate polynomial interpolation algorithm
E. Kaltofen, L. Yagati
Lecture Notes in Computer Science 358, 1989, pp. 467-474
Heuristic methods for operations with algebraic numbers
K.O. Geddes, G.H. Gonnet, T.J. Smedley
Lecture Notes in Computer Science 358, 1989, pp. 475-480
Asymptotic estimation of oscillating functions using an interval calculus
J. Shackell
Lecture Notes in Computer Science 358, 1989, pp. 481-489
A new algorithm for computing symbolic limits using hierarchical series
K.O. Geddes, G.H. Gonnet
Lecture Notes in Computer Science 358, 1989, pp. 490-495
Verification of non-identities in algebras
I.R. Hentzel, D.J. Pokrass
Lecture Notes in Computer Science 358, 1989, pp. 496-507
Equations in words
H. Abdulrab
Lecture Notes in Computer Science 358, 1989, pp. 508-520
Cayley factorization
N.L. White, T. McMillan
Lecture Notes in Computer Science 358, 1989, pp. 521-533
Complexity of computing the characters and the genre of a system of exterior differential equations
D.Yu. Grigoriev
Lecture Notes in Computer Science 358, 1989, pp. 534-543

Seiten < 1 2