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: Author="Shub, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Separation of complexity classes in Koiran's weak model
F. Cucker
,
M. Shub
,
S. Smale
Theoretical Computer Science
133
(1), 1994, pp. 3-14
Complexity of Bezout's theorem V: Polynomial time
M. Shub
,
S. Smale
Theoretical Computer Science
133
(1), 1994, pp. 141-164
Complexity of Bezout's theorem II. Volumes and probabilities
M. Shub
,
S. Smale
Progress in Mathematics
109
, 1993, pp. 267-285
On a theory of computation over the real numbers;
NP
completeness, recursive functions and universal machines
L. Blum
,
M. Shub
,
S. Smale
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 387-397
A simple unpredictable pseudo-random number generator
L. Blum
,
M. Blum
,
M. Shub
SIAM Journal on Computing
15
(2), 1986, May, pp. 364-383
Evaluating rational functions: infinite precision is finite cost and tractable on average
L. Blum
,
M. Shub
SIAM Journal on Computing
15
(2), 1986, May, pp. 384-398
Computational complexity: on the geometry of polynomials and a theory of cost: II
M. Shub
,
S. Smale
SIAM Journal on Computing
15
(1), 1986, February, pp. 145-161
Evaluating rational functions: Infinite precision is finite cost and tractable on average
L. Blum
,
M. Shub
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 261-267