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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Using forcing to prove completeness of resolution and paramodulation
John Pais
,
Gerald E. Peterson
Journal Symbolic Computation
11
(1-2), 1991, pp. 3-19
Theorem-proving with resolution and superposition
Michael Rusinowitch
Journal Symbolic Computation
11
(1-2), 1991, pp. 21-49
A completion procedure for conditional equations
Harald Ganzinger
Journal Symbolic Computation
11
(1-2), 1991, pp. 51-81
Automating inductionless induction using test sets
Deepak Kapur
,
Paliath Narendran
,
Hantao Zhang
Journal Symbolic Computation
11
(1-2), 1991, pp. 83-111
On word problems in Horn theories
Emmanuel Kounalis
,
Mȋchael Rusinowitch
Journal Symbolic Computation
11
(1-2), 1991, pp. 113-127
On the relation between resolution based and completion based theorem proving
Rolf Socher
Journal Symbolic Computation
11
(1-2), 1991, pp. 129-147
Term rewriting: Some experimental results
David A. Plaisted
,
Richard C. Potter
Journal Symbolic Computation
11
(1-2), 1991, pp. 149-180
Multi-valued logic and Gröbner bases with applications to modal logic
J. Chazarain
,
A. Riscos
,
J.A. Alonso
,
E. Briales
Journal Symbolic Computation
11
(3), 1991, pp. 181-194
The method of creative telescoping
Doron Zeilberger
Journal Symbolic Computation
11
(3), 1991, pp. 195-204
Elimination of composite superpositions may cause abortion
Andrea Sattler-Klein
Journal Symbolic Computation
11
(3), 1991, pp. 205-211
Rational geometry in space
Graziano Gentili
,
Michael A. O'Connor
Journal Symbolic Computation
11
(3), 1991, pp. 213-229
A method for symbolic evaluation of indefinite integrals containing special functions or their products
Jean C. Piquette
Journal Symbolic Computation
11
(3), 1991, pp. 231-249
Liouvillian solutions of linear differential equations with Liouvillian coefficients
Michael F. Singer
Journal Symbolic Computation
11
(3), 1991, pp. 251-273
Modelling waves with computer algebra
D.A. Diver
Journal Symbolic Computation
11
(3), 1991, pp. 275-289
Uses made of computer algera in physics
H.I. Cohen
,
J.P. Fitch
Journal Symbolic Computation
11
(3), 1991, pp. 291-305
Parallel multiplication and powering of polynomials
Carl G. Ponder
Journal Symbolic Computation
11
(4), 1991, pp. 307-320
Comparison of priority rules in pattern matching and term rewriting
Alain Laville
Journal Symbolic Computation
11
(4), 1991, pp. 321-347
A rewrite-based type discipline for a subset of computer algebra
H. Comon
,
D. Lugiez
,
Ph. Schnoebelen
Journal Symbolic Computation
11
(4), 1991, pp. 349-368
Asymptotic eigenfrequency distributions for the
N
-beam Euler-Bernoulli coupled beam equation with dissipative joints
Steven G. Krantz
,
William H. Paulsen
Journal Symbolic Computation
11
(4), 1991, pp. 369-418
Multilinear Cayley factorization
Neil L. White
Journal Symbolic Computation
11
(5-6), 1991, pp. 421-438
On the synthetic factorization of projectively invariant polynomials
Bernd Sturmfels
,
Walter Whiteley
Journal Symbolic Computation
11
(5-6), 1991, pp. 439-453
Invariant and geometric aspects of algebraic complexity theory I
Jacques Morgenstern
Journal Symbolic Computation
11
(5-6), 1991, pp. 455-469
The dotted straightening algorithm
Tim McMillan
,
Neil L. White
Journal Symbolic Computation
11
(5-6), 1991, pp. 471-482
Multivariate polynomials, standard tableaux, and representations of symmetric groups
Michael Clausen
Journal Symbolic Computation
11
(5-6), 1991, pp. 483-522
Invariant-theoretic methods in scene analysis and structural mechanics
Henry Crapo
Journal Symbolic Computation
11
(5-6), 1991, pp. 523-548
Seiten 1
2
>