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
[2]
Hilfe
Suche: Author="Giusti, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized polar varieties: Geometry and algorithms
B. Bank
,
M. Giusti
,
J. Heintz
,
L.M. Pardo
Journal of Complexity
21
(4), 2005, pp. 377-412
Polar varieties, real equation solving, and data structures: The hypersurface case
B. Bank
,
M. Giusti
,
J. Heintz
,
G.M. Mbakop
Journal of Complexity
13
(1), 1997, pp. 5-27
Lower bounds for diophantine approximation
D.Y. Franck-Le Plateau
,
M. Giusti
,
K. Hägele
,
J.E. Morais
,
J.L. Montaña
,
L.M. Pardo
misc, 1996
When polynomial equation systems can be "solved" fast?
M. Giusti
,
J. Heintz
,
J.E. Morais
,
L.M. Pardo
Lecture Notes in Computer Science
948
, 1995, pp. 205-231
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
Complexity of standard bases in projective dimension zero
M. Giusti
Lecture Notes in Computer Science
378
, 1989, pp. 333-335
Combinatorial dimension theory of algebraic varieties
M. Giusti
Computational aspects of commutative algebra, 1989, pp. 115-131
A note on the complexity of constructing standard bases
M. Giusti
Lecture Notes in Computer Science
204
, 1985, pp. 411-412
Some effectivity problems in polynomial ideal theory
M. Giusti
Lecture Notes in Computer Science
174
, 1984, pp. 159-171