J. Complexity - researchr journal

researchr

You are not signed in
Sign in
Sign up

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

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

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

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

runs on WebDSL