Journal of Complexity, Volume 4

Volume 4, Number 1, March 1988

• George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou:
  Probabilistic satisfiability. 1-11
  Electronic Edition (link) BibTeX
• Vladimir Rokhlin:
  A fast algorithm for the discrete laplace transformation. 12-32
  Electronic Edition (link) BibTeX
• Zvi Galil, Raffaele Giancarlo:
  Data structures and algorithms for approximate string matching. 33-72
  Electronic Edition (link) BibTeX
• Boleslaw Z. Kacewicz, Mario Milanese, Antonio Vicino:
  Conditionally optimal algorithms and estimation of reduced order models. 73-85
  Electronic Edition (link) BibTeX

Volume 4, Number 2, June 1988

• H. T. Kung:
  Deadlock avoidance for systolic communication. 87-105
  Electronic Edition (link) BibTeX
• Tomaso Poggio, Harry Voorhees, Alan L. Yuille:
  A regularized solution to edge detection. 106-123
  Electronic Edition (link) BibTeX
• Lenore Blum:
  A new simple homotopy algorithm for linear programming I. 124-136
  Electronic Edition (link) BibTeX
• Leonid Hurwicz, Thomas Marschak:
  Approximating a function by choosing a covering of its domain and ? points from its range. 137-174
  Electronic Edition (link) BibTeX

Volume 4, Number 3, September 1988

• Yaser S. Abu-Mostafa:
  Guest editorial. 175-
  Electronic Edition (link) BibTeX
• J. Stephen Judd:
  On the complexity of loading shallow neural networks. 177-192
  Electronic Edition (link) BibTeX
• Eric B. Baum:
  On the capabilities of multilayer perceptrons. 193-215
  Electronic Edition (link) BibTeX
• Fernando J. Pineda:
  Dynamics and architecture for neural computation. 216-245
  Electronic Edition (link) BibTeX
• Yaser S. Abu-Mostafa:
  Lower bound for connectivity in local-learning neural networks. 246-255
  Electronic Edition (link) BibTeX

Volume 4, Number 4, December 1988

• Joseph B. Kadane, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
  On adaption with noisy information. 257-276
  Electronic Edition (link) BibTeX
• Yaser S. Abu-Mostafa:
  Random problems. 277-284
  Electronic Edition (link) BibTeX
• D. V. Chudnovsky, G. V. Chudnovsky:
  Algebraic complexities and algebraic curves over finite fields. 285-316
  Electronic Edition (link) BibTeX
• Terrance E. Boult, Christopher (Krzysztof) Sikorski:
  Can we approximate zeros of functions with nonzero topological degree? 317-329
  Electronic Edition (link) BibTeX
• Heiko Schröder:
  VLSI-sorting evaluated under the linear model. 330-355
  Electronic Edition (link) BibTeX
• Marek Kowalski, Waldemar Sielski:
  Approximation of smooth periodic functions in several variables. 356-372
  Electronic Edition (link) BibTeX
• Boleslaw Z. Kacewicz:
  Minimum asymptotic error of algorithms for solving ODE. 373-389
  Electronic Edition (link) BibTeX