External Links

    Journal: J. Complexity

    Volume 7, Issue 4

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

    Volume 7, Issue 3

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

    Volume 7, Issue 2

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

    Volume 7, Issue 1

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