Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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
- Erich Novak:
The Real Number Model in Numerical Analysis. 57-73 - Yongsheng Sun, Chenyong Wang:
Average Error Bounds of Best Approximation of Continuous Functions on the Wiener Space. 74-104 - Spassimir H. Paskov:
Termination Criteria for Linear Problems. 105-137 - Leonid Khachiyan:
On the Complexity of Approximating Extremal Determinants in Matrices. 138-153 - Arthur G. Werschulz:
The Complexity of Multivariate Elliptic Problems with Analytic Data. 154-173 - André Galligo, Nicolai N. Vorobjov Jr.:
Complexity of Finding Irreducible Components of a Semialgebraic Set. 174-193
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 - Boleslaw Z. Kacewicz, Marek A. Kowalski:
Recovering Linear Operators from Inaccurate Data. 227-239 - Leszek Plaskota:
Average Complexity for Linear Problems in a Model with Varying Information Noise. 240-264 - Ker-I Ko:
Computational Complexity of Fixed Points and Intersection Points. 265-292 - Vladimir N. Temlyakov:
An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. 293-307
Volume 11, Number 3, September 1995
- Christoph Thiel:
Short Proofs Using Compact Representations of Algebraic Integers. 310-329 - Jürgen Klose:
Binary Segmentation for Multivariate Polynomials. 330-343 - Thomas Lickteig, Klaus Meer:
A Note on Testing the Resultant. 344-351 - Alan Edelman:
On the Determinant of a Uniformly Distributed Complex Matrix. 352-357 - Felipe Cucker, Pascal Koiran:
Computing over the Reals with Addition and Order: Higher Complexity Classes. 358-376 - Ming Gu:
Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard. 377-391
Volume 11, Number 4, December 1995
- Peter Mathé:
The Optimal Error of Monte Carlo Integration. 394-415 - Karin Frank:
Complexity of Local Solution of Multivariate Integral Equations. 416-434 - James P. Jones, Aviezri S. Fraenkel:
Complexities of Winning Strategies in Diophantine Games. 435-455 - Klaus Wilderotter:
The Fine Structure of the n-Widths of Hp-Spaces in Lq(-1, 1). 456-460 - Gensun Fang:
Average Widths of WrHomega in C(R). 461-473 - Konstantin Yu. Osipenko, O. G. Parfenov:
Ismagilov Type Theorems for Linear, Gel?fand and Bernstein n-Widths. 474-492 - Arthur G. Werschulz:
What Is the Complexity of Solution-Restricted Operator Equations? 493-514
a service of 
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.
last updated on 2023-06-01 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
