![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Journal of Complexity, Volume 8
Volume 8, Number 1, March 1992
- Victor Y. Pan:
Parallel solution of toeplitzlike linear systems. 1-21 - Erich Novak:
Optimal linear randomized methods for linear operators in Hilbert spaces. 22-36 - Tadeusz Strzemecki:
Polynomial-time algorithms for generation of prime implicants. 37-63 - Georgii G. Magaril-Il'yaev, Vladimir M. Tikhomirov:
Average dimension and ?-widths of classes of functions on the whole line. 64-71 - Siegfried Graf:
Barnsley's scheme for the fractal encoding of images. 72-78 - Nikolaj P. Korneichuk:
Encoding and recovery of operator values. 79-91
Volume 8, Number 2, June 1992
- Henryk Wozniakowski:
Complexity of verification and computation for IBC problems. 93-123 - Erich Novak, Henryk Wozniakowski:
Relaxed verification for continuous problems. 124-152 - Arkadi S. Nemirovsky:
Information-based complexity of linear operator equations. 153-175 - Sergei V. Pereverzev
, Cosnazar C. Scharipov:
Information complexity of equations of the second kind with compact operators in Hilbert space. 176-202
Volume 8, Number 3, September 1992
- Peter Bürgisser, Thomas Lickteig, Michael Shub:
Test complexity of generic polynomials. 203-215 - Ding-Zhu Du, Ker-I Ko:
A note on best fractions of a computable real number. 216-229 - Felipe Cucker
:
PR != NCR. 230-238 - Lan Wen:
Anosov endomorphisms on branched surfaces. 239-264 - Roberto Tempo, Vito Cerone:
Robust stability: The computational complexity point of view. 265-276 - Stefan Heinrich:
Lower bounds for the complexity of Monte Carlo function approximation. 277-300 - Leszek Plaskota:
Function approximation and integration on the wiener space with noisy data. 301-323 - Klaus Wilderotter:
n-Widths of Hp-spaces in Lq(-1, 1). 324-335
Volume 8, Number 4, December 1992
- Henryk Wozniakowski:
Average case complexity of linear multivariate problems I. Theory. 337-372 - Henryk Wozniakowski:
Average case complexity of linear multivariate problems II. Applications. 373-392 - Prasoon Tiwari:
A problem that is easier to solve on the unit-cost algebraic RAM. 393-397 - Shui-Nee Chow, Kenneth J. Palmer:
On the numerical computation of orbits of dynamical systems: The higher dimensional case. 398-423 - Grzegorz W. Wasilkowski:
On a posteriori upper bounds for approximating linear functionals in a probabilistic setting. 424-433 - Lung-Tien Liu, Gen-Huey Chen, Ching-Sung Lu:
On the complexity of generating synchronizable test sequences. 434-450 - Klaus Meer:
A note on a P NP result for a restricted class of real machines. 451-453 - Felipe Cucker
, A. Torrecillas:
Two P-complete problems in the theory of the reals. 454-466 - Gensun Fang, Yongping Liu:
On the optimal quadrature least Linfinity-norm of monosplines with free knots on the real axis. 467-487
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.