no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Approximation in a continuous model of computing
|
Mount, K |
|
1985 |
1 |
1 |
p. 158-168 11 p. |
article |
2 |
A survey of information-based complexity
|
Woźniakowski, H |
|
1985 |
1 |
1 |
p. 11-44 34 p. |
article |
3 |
A 71 60 theorem for bin packing
|
Johnson, David S |
|
1985 |
1 |
1 |
p. 65-106 42 p. |
article |
4 |
Average case optimality
|
Wasilkowski, G.W |
|
1985 |
1 |
1 |
p. 107-117 11 p. |
article |
5 |
Complexity of approximately solved problems
|
Traub, J.F |
|
1985 |
1 |
1 |
p. 3-10 8 p. |
article |
6 |
Editorial Board
|
|
|
1985 |
1 |
1 |
p. i- 1 p. |
article |
7 |
Memory requirements for balanced computer architectures
|
Kung, H.T |
|
1985 |
1 |
1 |
p. 147-157 11 p. |
article |
8 |
Monte-Carlo algorithms for the planar multiterminal network reliability problem
|
Karp, Richard M |
|
1985 |
1 |
1 |
p. 45-64 20 p. |
article |
9 |
Optimal algorithms for image understanding: Current status and future plans
|
Lee, D |
|
1985 |
1 |
1 |
p. 138-146 9 p. |
article |
10 |
Quasi-GCD computations
|
Schönhage, Arnold |
|
1985 |
1 |
1 |
p. 118-137 20 p. |
article |
11 |
Why a journal of complexity?
|
Traub, J.F |
|
1985 |
1 |
1 |
p. 1- 1 p. |
article |