Journal of Complexity, Volume 7

Volume 7, Number 1, March 1991

• Iain M. Johnstone, Bernard W. Silverman:
  Discretization effects in statistical inverse problems. 1-34
  
• Boleslaw Z. Kacewicz, Leszek Plaskota:
  Noisy information for linear problems in the asymptotic setting. 35-57
  
• Feng Gao:
  Probabilistic analysis of numerical integration algorithms. 58-69
  
• Yosi Yomdin:
  Complexity of functions: Some questions, conjectures, and results. 70-96
  
• Matthew A. Grayson:
  On the distance to the zero-set of a polynomial. 97-
  
• Tomasz Jackowski:
  Complexity of multilinear problems in the average case setting. 98-120
  

Volume 7, Number 2, June 1991

• A. S. Nemirovsky:
  On optimality of Krylov's information when solving linear operator equations. 121-130
  
• Stanislaw J. Szarek:
  Condition numbers of random matrices. 131-149
  
• Arthur G. Werschulz:
  Optimal residual algorithms for linear operator equations. 150-173
  
• Jerzy W. Jaromczyk, Grzegorz Swiatek:
  A role of lower semicontinuous functions in the combinatorial complexity of geometric problems. 174-183
  
• Jörg-Detlef Kern:
  The parallel complexity of function approximation. 184-199
  
• Edith Cohen, Michael Tarsi:
  NP-Completeness of graph decomposition problems. 200-212
  
• Mark A. Kon, Roberto Tempo:
  Linearity of algorithms and a result of Ando. 213-217
  

Volume 7, Number 3, September 1991

• Joseph F. Traub:
  Solvability of III-posed problems: An historical note. 219-
  
• Mark A. Kon, Klaus Ritter, Arthur G. Werschulz:
  On the average case solvability of III-posed problems. 220-224
  
• Nicholas N. Vakhania:
  Gaussian mean boundedness of densely defined linear operators. 225-231
  
• Robert S. Maier:
  A path integral approach to data structure evolution. 232-260
  
• Peter Mathé:
  Random approximation of Sobolev embeddings. 261-281
  
• Bruno Codenotti, Mauro Leoncini:
  Matrix inversion in RNC¹. 282-295
  
• Martin Mundhenk, Rainer Schuler:
  Random languages for nonuniform complexity classes. 296-310
  
• Johannes Buchmann, Hugh C. Williams:
  Some remarks concerning the complexity of computing class groups of quadratic fields. 311-315
  
• Santosh S. Venkatesh, Pierre Baldi:
  Programmed interactions in higher-order neural networks: Maximal capacity. 316-337
  

Volume 7, Number 4, December 1991

• Stefan Heinrich, Jörg-Detlef Kern:
  Parallel information-based complexity. 339-370
  
• Eric Kostlan:
  Statistical complexity of dominant eigenvector calculation. 371-379
  
• Klaus Weihrauch:
  On the complexity of online computations of real functions. 380-394
  
• Jeff I. Chu, Georg Schnitger:
  The communication complexity of several problems in matrix computation. 395-407
  
• Dario Bini, Victor Y. Pan:
  On the evaluation of the Eigenvalues of a banded toeplitz block matrix. 408-424
  
• Jeremy A. Kahn:
  Newtonian graphs for families of complex polynomials. 425-442
  
• Santosh S. Venkatesh, Pierre Baldi:
  Programmed interactions in higher-order neural networks: The outer-product algorithm. 443-479
  

Last update Tue Feb 14 04:20:05 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page