@article{Grayson/91,
AUTHOR = {Grayson, Matthew A.},
TITLE = {On the distance to the zero-set of a polynomial},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {97},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Traub/91,
AUTHOR = {Traub, J.F.},
TITLE = {Solvability of ill-posed problems: An historical note},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {219},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Johnstone-Silverman/91,
AUTHOR = {Johnstone, Iain M. and Silverman, Bernard W.},
TITLE = {Discretization effects in statistical inverse problems},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {1-34},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kacewicz-Plaskota/91,
AUTHOR = {Kacewicz, B.Z. and Plaskota, L.},
TITLE = {Noisy information for linear problems in the asymptotic setting},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {35-57},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gao/91,
AUTHOR = {Gao, Feng},
TITLE = {Probabilistic analysis of numerical integration algorithms},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {58-69},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Yomdin/91,
AUTHOR = {Yomdin, Y.},
TITLE = {Complexity of functions: Some questions, conjectures, and results},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {70-96},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Jackowski/91,
AUTHOR = {Jackowski, Tomasz},
TITLE = {Complexity of multilinear problems in the average case setting},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {98-120},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Nemirovsky/91,
AUTHOR = {Nemirovsky, A.S.},
TITLE = {On optimality of Krylov's information when solving linear operator equations},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {121-130},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Szarek/91,
AUTHOR = {Szarek, Stanislaw J.},
TITLE = {Condition numbers of random matrices},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {131-149},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Werschulz/91,
AUTHOR = {Werschulz, Arthur G.},
TITLE = {Optimal residual algorithms for linear operator equations},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {150-173},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Jaromczyk-Swiatek/91,
AUTHOR = {Jaromczyk, Jerzy W. and {\'S}wi{\c{a}}tek, Grzegorz},
TITLE = {A role of lower semicontinuous functions in the combinatorial complexity of geometric problems},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {174-183},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kern/91,
AUTHOR = {Kern, J{\"o}rg-Detlef},
TITLE = {The parallel complexity of function approximation},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {184-199},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Cohen-Tarsi/91,
AUTHOR = {Cohen, Edith and Tarsi, Michael},
TITLE = {NP-completeness of graph decomposition problems},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {200-212},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kon-Tempo/91,
AUTHOR = {Kon, M.A. and Tempo, R.},
TITLE = {Linearity of algorithms and a result of Ando},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {213-217},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kon-Ritter-Werschulz/91,
AUTHOR = {Kon, Mark A. and Ritter, Klaus and Werschulz, Arthur G.},
TITLE = {On the average case solvability of ill-posed problems},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {220-224},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Vakhania/91,
AUTHOR = {Vakhania, Nicholas N.},
TITLE = {Gaussian mean boundedness of densely defined linear operators},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {225-231},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Maier/91,
AUTHOR = {Maier, Robert S.},
TITLE = {A path integral approach to data structure evolution},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {232-260},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Mathe/91,
AUTHOR = {Math{\'e}, Peter},
TITLE = {Random approximation of Sobolev embeddings},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {261-281},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Codenotti-Leoncini/91,
AUTHOR = {Codenotti, B. and Leoncini, M.},
TITLE = {Matrix inversion in $RNC^1$},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {282-295},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Mundhenk-Schuler/91,
AUTHOR = {Mundhenk, Martin and Schuler, Rainer},
TITLE = {Random languages for nonuniform complexity classes},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {296-310},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Buchmann-Williams/91,
AUTHOR = {Buchmann, Johannes A. and Williams, Hugh C.},
TITLE = {Some remarks concerning the complexity of computing class groups of quadratic fields},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {311-315},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Venkatesh-Baldi/91a,
AUTHOR = {Venkatesh, Santosh S. and Baldi, Pierre},
TITLE = {Programmed interactions in higher-order neural networks: Maximal capacity},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {316-337},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Heinrich-Kern/91,
AUTHOR = {Heinrich, Stefan and Kern, J{\"o}rg-Detlef},
TITLE = {Parallel information-based complexity},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {339-370},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kostlan/91,
AUTHOR = {Kostlan, Eric},
TITLE = {Statistical complexity of dominant eigenvector calculation},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {371-379},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Weihrauch/91,
AUTHOR = {Weihrauch, Klaus},
TITLE = {On the complexity of online computations of real functions},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {380-394},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Chu-Schnitger/91,
AUTHOR = {Chu, Jeff I. and Schnitger, Georg},
TITLE = {The communication complexity of several problems in matrix computation},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {395-407},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bini-Pan/91,
AUTHOR = {Bini, Dario and Pan, Victor},
TITLE = {On the evaluation of the eigenvalues of a banded Toeplitz block matrix},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {408-424},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kahn/91,
AUTHOR = {Kahn, Jeremy},
TITLE = {Newtonian graphs for families of complex polynomials},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {425-442},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Venkatesh-Baldi/91,
AUTHOR = {Venkatesh, Santosh S. and Baldi, Pierre},
TITLE = {Programmed interactions in higher-order neural networks: The outer-product algorithm},
JOURNAL = {J. Complexity},
VOLUME = {7},
PAGES = {443-479},
YEAR = {1991},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}