Journal of Complexity, Volume 6

Volume 6, Number 1, March 1990

• Anargyros Papageorgiou, Grzegorz W. Wasilkowski:
  On the average complexity of multivariate problems. 1-23
  
• Silviu Guiasu:
  Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach. 24-40
  
• Peter Mathé:
  s-Numbers in information-based complexity. 41-66
  
• Eric B. Baum:
  On learning a union of half spaces. 67-101
  
• Donald G. Saari:
  On the design of complex organizations and distributive algorithms. 102-118
  
• Olga R. Chuyan, Aleksei G. Sukharev:
  On adaptive and nonadaptive stochastic and deterministic algorithms. 119-127
  

Volume 6, Number 2, June 1990

• Jehoshua Bruck, Joseph W. Goodman:
  On the power of neural networks for solving hard problems. 129-135
  
• Boleslaw Z. Kacewicz:
  On sequential and parallel solution of initial value problems. 136-148
  
• Giulia Galbiati:
  On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. 149-165
  
• Eberhard Triesch:
  A note on a theorem of Blum, Shub, and Smale. 166-169
  
• David Lee:
  Discontinuity detection from band-limited signals. 170-191
  
• Yaser S. Abu-Mostafa:
  Learning from hints in neural networks. 192-198
  
• Leszek Plaskota:
  On average case complexity of linear problems with noisy information. 199-230
  

Volume 6, Number 3, September 1990

• Stefan Heinrich:
  Probabilistic complexity analysis for linear problems in bounded domains. 231-255
  
• Klaus Meer:
  Computations over Z and R: A comparison. 256-263
  
• Ingo Althöfer:
  The complexity of a simple stochastic OR-tree model in which "directional search" is bad. 264-277
  
• Grzegorz W. Wasilkowski:
  Note on quantization for signals with bounded (r + 1)st derivative. 278-289
  
• David L. Donoho, Michael Nussbaum:
  Minimax quadratic estimation of a quadratic functional. 290-323
  
• Adam W. Bojanczyk:
  Some complexity results in parallel matrix-based signal processing. 324-336
  

Volume 6, Number 4, December 1990

• Klaus Ritter:
  Approximation and optimization on the Wiener space. 337-364
  
• Ferng-Ching Lin, Jiann-Cherng Shish:
  Space and time complexities of balanced sorting on processor arrays. 365-378
  
• Misako Yokoyama:
  Computing topological degree using noisy information. 379-388
  
• Tomasz Jackowski:
  Complexity of multilinear problems in the worst case setting. 389-408
  
• Jean-Marc Gambaudo, Charles Philippe Tresser:
  Diffeomorphisms with infinitely many strange attractors. 409-416
  
• Michael Ben-Or, Prasoon Tiwari:
  Simple algorithms for approximating all roots of a polynomial with real roots. 417-442