Journal of Complexity, Volume 4

Volume 4, Number 1, March 1988

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

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

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

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

Last update Mon May 20 01:09:22 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page