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=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing the decompostion of primes
p
and
p
-adic absolute values in semi-simple algebras over
Q
R. Böffgen
,
M.A. Reichert
Journal Symbolic Computation
4
(1), 1987, pp. 3-10
On principal ideal testing in algebraic number fields
Johannes Buchmann
,
H.C. Williams
Journal Symbolic Computation
4
(1), 1987, pp. 11-19
Computing the measure of a polynomial
L. Cerlienco
,
M. Mignotte
,
F. Piras
Journal Symbolic Computation
4
(1), 1987, pp. 21-33
Application of symbolic manipulation to the Hecke transformations of modular forms in two variables, II
Harvey Cohn
,
Jesse Ira Deutsch
Journal Symbolic Computation
4
(1), 1987, pp. 35-40
Computation of class numbers by an analytic method
Carsten Eckhardt
Journal Symbolic Computation
4
(1), 1987, pp. 41-52
What is the rank of the Demjanenko matrix?
H.G. Folz
,
H.G. Zimmer
Journal Symbolic Computation
4
(1), 1987, pp. 53-67
The construction of maximal orders over a Dedekind domain
David J. Ford
Journal Symbolic Computation
4
(1), 1987, pp. 69-75
Deterministic irreducibility testing of polynomials over large finite fields
Erich Kaltofen
Journal Symbolic Computation
4
(1), 1987, pp. 77-82
Polynomials for primitive nonsolvable permutation groups of degree
d\le15
Gunter Malle
Journal Symbolic Computation
4
(1), 1987, pp. 83-92
Polynome mit der Galoisgruppe
M_11
über
Q
B. Heinrich Matzat
,
Andreas Zeh-Marschke
Journal Symbolic Computation
4
(1), 1987, pp. 93-97
Comutation of integral bases in certain
S_n
extensions of
Q
Eckart Maus
Journal Symbolic Computation
4
(1), 1987, pp. 99-102
On the resolution of Thue inequalities
Attila Pethö
Journal Symbolic Computation
4
(1), 1987, pp. 103-109
Towards a soluble quotient algorithm
W. Plesken
Journal Symbolic Computation
4
(1), 1987, pp. 111-122
A modification of the LLL reduction algorithm
M. Pohst
Journal Symbolic Computation
4
(1), 1987, pp. 123-127
Feasible arithmetic computations: Valiant's hypothesis
Joachim von zur Gathen
Journal Symbolic Computation
4
(2), 1987, pp. 137-172
Theory links: Applications to automated theorem proving
Neil V. Murray
,
Erik Rosenthal
Journal Symbolic Computation
4
(2), 1987, pp. 173-190
Embedding Boolean expressions into logic programming
Wolfram Büttner
,
Helmut Simonis
Journal Symbolic Computation
4
(2), 1987, pp. 191-205
Mechanical translation of set theoretic problem specifications into efficient RAM Code - A case study
Robert Paige
,
Fritz Henglein
Journal Symbolic Computation
4
(2), 1987, pp. 207-232
Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
Jean H. Gallier
Journal Symbolic Computation
4
(2), 1987, pp. 233-254
The transitive groups of degree twelve
Gordon F. Royle
Journal Symbolic Computation
4
(2), 1987, pp. 255-268
Functional programming with combinators
Jacek Gibert
Journal Symbolic Computation
4
(3), 1987, pp. 269-293
Simplifying conditional term rewriting systems: Unification, termination and confluence
Stephane Kaplan
Journal Symbolic Computation
4
(3), 1987, pp. 295-334
On the algebraic and differential Newton-Puiseux polygons
A. Hilali
Journal Symbolic Computation
4
(3), 1987, pp. 335-349
A generalization of reduction rings
Sabine Stifter
Journal Symbolic Computation
4
(3), 1987, pp. 351-364
GI/S: A graphical user interface for symbolic computation systems
Douglas A. Young
,
Paul S. Wang
Journal Symbolic Computation
4
(3), 1987, pp. 365-380
Seiten 1
2
>