Zobrazeno 1 - 10
of 33
pro vyhledávání: '"J. F. Traub"'
Publikováno v:
Science. 272:15a-19
Autor:
J. F. Traub
Publikováno v:
Science (New York, N.Y.). 272(5258)
Autor:
J. F. Traub
Publikováno v:
From Topology to Computation: Proceedings of the Smalefest ISBN: 9781461276487
I am delighted to have this opportunity to comment on the work of Steve Smale. Mike Shub was kind enough to give me an advance copy of his excellent paper (Shub [93]), which was very useful for it served as a reminder of the many areas in the theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8848aa61c53aecd70141db7bdf48f958
https://doi.org/10.1007/978-1-4612-2740-3_31
https://doi.org/10.1007/978-1-4612-2740-3_31
Autor:
J. F. Traub
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783540544586
FCT
FCT
Information-based complexity (IBC) studies the computational complexity of infinite dimensional problems. These are problems where either the input or output are elements of infinite dimensional spaces. Such problems commonly arise in the continuous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e4d86c1ededa12b52b004a92740d93e
https://doi.org/10.1007/3-540-54458-5_52
https://doi.org/10.1007/3-540-54458-5_52
Autor:
J. F. Traub
Publikováno v:
Annals of the New York Academy of Sciences. 426:11-18
Autor:
J. F. Traub, C. W. Gear, B. N. Parlett, J. Ortega, L. F. Shampine, John R. Rice, M. Schultz, P. Wolfe
Publikováno v:
ACM SIGNUM Newsletter. 14:1-48
This report on research in numerical computation is part of the Computer Science and Engineering Research Study (COSERS) which is aimed at technically educated people outside the Computer Science field. This goal led the panel to face many difficult
Autor:
D. Reginald Traylor, David Shelupsky, Murray R. Spiegel, J. G. Mauldon, T. G. Ostrom, Q. G. Mohammad, J. F. Traub, Dwight B. Goodner
Publikováno v:
The American Mathematical Monthly. 69:889-909
Publikováno v:
Communications of the ACM. 8:553-556
ACM proposes to republish contents of Communications Algorithms section is useable looseleaf format, with bimonthly updating service, provided there is sufficient demand. For details, see News item on page 583.