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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
When does
\langle T\rangle
equal sat
(T)
?
François Lemaire
,
Marc Moreno Maza
,
Wei Pan
,
Yuzhen Xie
Journal Symbolic Computation
46
(12), 2011, pp. 1291-1305
Approximate polynomial GCD over integers
Nagasaka Kosaku
Journal Symbolic Computation
46
(12), 2011, pp. 1306-1317
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
Sekigawa Hiroshi
Journal Symbolic Computation
46
(12), 2011, pp. 1318-1335
How to implement a modular form
Raum Martin
Journal Symbolic Computation
46
(12), 2011, pp. 1336-1354
Symbolic computation of conservation laws for nonlinear partial differential equations in multiple space dimensions
Douglas Poole
,
Willy Hereman
Journal Symbolic Computation
46
(12), 2011, pp. 1355-1377
Homotopy techniques for multiplication modulo triangular sets
Alin Bostan
,
Muhammad F.I. Chowdhury
,
Joris van der Hoeven
,
Éric Schost
Journal Symbolic Computation
46
(12), 2011, pp. 1378-1402
Cayley graphs and
G
-graphs: Some applications
Alain Bretto
,
Alain Faisant
Journal Symbolic Computation
46
(12), 2011, pp. 1403-1412
Seiten
<
1
2
3
4