Journal of Complexity, Volume 11

Volume 11, Number 1, March 1995

• Grzegorz W. Wasilkowski, Henryk Wozniakowski:
  Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems. 1-56
  Electronic Edition (link) BibTeX
• Erich Novak:
  The Real Number Model in Numerical Analysis. 57-73
  Electronic Edition (link) BibTeX
• Yongsheng Sun, Chenyong Wang:
  Average Error Bounds of Best Approximation of Continuous Functions on the Wiener Space. 74-104
  Electronic Edition (link) BibTeX
• Spassimir H. Paskov:
  Termination Criteria for Linear Problems. 105-137
  Electronic Edition (link) BibTeX
• Leonid Khachiyan:
  On the Complexity of Approximating Extremal Determinants in Matrices. 138-153
  Electronic Edition (link) BibTeX
• Arthur G. Werschulz:
  The Complexity of Multivariate Elliptic Problems with Analytic Data. 154-173
  Electronic Edition (link) BibTeX
• André Galligo, Nicolai Vorobjov:
  Complexity of Finding Irreducible Components of a Semialgebraic Set. 174-193
  Electronic Edition (link) BibTeX

Volume 11, Number 2, June 1995

• Henry P. Wynn, Anatoly A. Zhigljavsky:
  Achieving the Ergodically Optimal Convergence Rate for a One-Dimensional Minimization Problem. 196-226
  Electronic Edition (link) BibTeX
• Boleslaw Z. Kacewicz, Marek A. Kowalski:
  Recovering Linear Operators from Inaccurate Data. 227-239
  Electronic Edition (link) BibTeX
• Leszek Plaskota:
  Average Complexity for Linear Problems in a Model with Varying Information Noise. 240-264
  Electronic Edition (link) BibTeX
• Ker-I Ko:
  Computational Complexity of Fixed Points and Intersection Points. 265-292
  Electronic Edition (link) BibTeX
• Vladimir N. Temlyakov:
  An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. 293-307
  Electronic Edition (link) BibTeX

Volume 11, Number 3, September 1995

• Christoph Thiel:
  Short Proofs Using Compact Representations of Algebraic Integers. 310-329
  Electronic Edition (link) BibTeX
• Jürgen Klose:
  Binary Segmentation for Multivariate Polynomials. 330-343
  Electronic Edition (link) BibTeX
• Thomas Lickteig, Klaus Meer:
  A Note on Testing the Resultant. 344-351
  Electronic Edition (link) BibTeX
• Alan Edelman:
  On the Determinant of a Uniformly Distributed Complex Matrix. 352-357
  Electronic Edition (link) BibTeX
• Felipe Cucker, Pascal Koiran:
  Computing over the Reals with Addition and Order: Higher Complexity Classes. 358-376
  Electronic Edition (link) BibTeX
• Ming Gu:
  Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard. 377-391
  Electronic Edition (link) BibTeX

Volume 11, Number 4, December 1995

• Peter Mathé:
  The Optimal Error of Monte Carlo Integration. 394-415
  Electronic Edition (link) BibTeX
• Karin Frank:
  Complexity of Local Solution of Multivariate Integral Equations. 416-434
  Electronic Edition (link) BibTeX
• James P. Jones, Aviezri S. Fraenkel:
  Complexities of Winning Strategies in Diophantine Games. 435-455
  Electronic Edition (link) BibTeX
• Klaus Wilderotter:
  The Fine Structure of the n-Widths of H^p-Spaces in L_q(-1, 1). 456-460
  Electronic Edition (link) BibTeX
• Gensun Fang:
  Average Widths of W^rH^omega in C(R). 461-473
  Electronic Edition (link) BibTeX
• Konstantin Yu. Osipenko, O. G. Parfenov:
  Ismagilov Type Theorems for Linear, Gel?fand and Bernstein n-Widths. 474-492
  Electronic Edition (link) BibTeX
• Arthur G. Werschulz:
  What Is the Complexity of Solution-Restricted Operator Equations? 493-514
  Electronic Edition (link) BibTeX