Journal of Complexity, Volume 1

Volume 1, Number 1, October 1985

Joseph F. Traub:
Why a journal of complexity? 1-
Electronic Edition (link) BibTeX
Joseph F. Traub:
Complexity of approximately solved problems. 3-10
Electronic Edition (link) BibTeX
Henryk Wozniakowski:
A survey of information-based complexity. 11-44
Electronic Edition (link) BibTeX
Richard M. Karp, Michael Luby:
Monte-Carlo algorithms for the planar multiterminal network reliability problem. 45-64
Electronic Edition (link) BibTeX
David S. Johnson, M. R. Garey:
A 71/60 theorem for bin packing. 65-106
Electronic Edition (link) BibTeX
Grzegorz W. Wasilkowski:
Average case optimality. 107-117
Electronic Edition (link) BibTeX
Arnold Schönhage:
Quasi-GCD computations. 118-137
Electronic Edition (link) BibTeX
David Lee:
Optimal algorithms for image understanding: Current status and future plans. 138-146
Electronic Edition (link) BibTeX
H. T. Kung:
Memory requirements for balanced computer architectures. 147-157
Electronic Edition (link) BibTeX
Kenneth R. Mount, Stanley Reiter:
Approximation in a continuous model of computing. 158-168
Electronic Edition (link) BibTeX

Joseph F. Traub:
From the editor. 169-
Electronic Edition (link) BibTeX
Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi:
Optimal precision in the presence of uncertainty. 170-196
Electronic Edition (link) BibTeX
Krzysztof A. Sikorski:
Optimal solution of nonlinear equations. 197-209
Electronic Edition (link) BibTeX
Ker-I Ko:
Continuous optimization problems and a polynomial hierarchy of real functions. 210-231
Electronic Edition (link) BibTeX
Arthur G. Werschulz:
Complexity of differential and integral equations. 232-255
Electronic Edition (link) BibTeX
Joseph B. Kadane:
Parallel and sequential computation: a statistician's view. 256-263
Electronic Edition (link) BibTeX
Leonid Hurwicz, Thomas Marschak:
Discrete allocation mechanisms: Dimensional requirements for resource-allocation mechanisms when desired outcomes are unbounded. 264-303
Electronic Edition (link) BibTeX