default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 1
Volume 1, Number 1, October 1985
- Joseph F. Traub:
Why a journal of complexity? 1- - Joseph F. Traub:
Complexity of approximately solved problems. 3-10 - Henryk Wozniakowski:
A survey of information-based complexity. 11-44 - Richard M. Karp, Michael Luby:
Monte-Carlo algorithms for the planar multiterminal network reliability problem. 45-64 - David S. Johnson, M. R. Garey:
A 71/60 theorem for bin packing. 65-106 - Grzegorz W. Wasilkowski:
Average case optimality. 107-117 - Arnold Schönhage:
Quasi-GCD computations. 118-137 - David Lee:
Optimal algorithms for image understanding: Current status and future plans. 138-146 - H. T. Kung:
Memory requirements for balanced computer architectures. 147-157 - Kenneth R. Mount, Stanley Reiter:
Approximation in a continuous model of computing. 158-168
Volume 1, Number 2, December 1985
- Joseph F. Traub:
From the editor. 169- - Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi:
Optimal precision in the presence of uncertainty. 170-196 - Krzysztof A. Sikorski:
Optimal solution of nonlinear equations. 197-209 - Ker-I Ko:
Continuous optimization problems and a polynomial hierarchy of real functions. 210-231 - Arthur G. Werschulz:
Complexity of differential and integral equations. 232-255 - Joseph B. Kadane:
Parallel and sequential computation: a statistician's view. 256-263 - Leonid Hurwicz, Thomas Marschak:
Discrete allocation mechanisms: Dimensional requirements for resource-allocation mechanisms when desired outcomes are unbounded. 264-303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
