default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 9
Volume 9, Number 1, March 1993
- Festschrift for Joseph F. Traub. 1-3
- Michael Shub, Steve Smale:
Complexity of Bezout's Theorem: III. Condition Number and Packing. 4-14 - Erich Novak, Klaus Ritter:
Some Complexity Results for Zero Finding for Univariate Functions. 15-40 - Vladimir N. Temlyakov:
On Approximate Recovery of Functions with Bounded Mixed Derivative. 41-59 - Harald Niederreiter:
Improved Error Bounds for Lattice Rules. 60-75 - David Lee, Grzegorz W. Wasilkowski:
Discontinuity Detection and Thresholding-A Stochastic Approach. 76-96 - Arieh Iserles, Gustaf Söderlind:
Global Bounds on Numerical Error for Ordinary Differential Equations. 97-112 - Boleslaw Z. Kacewicz
, Leszek Plaskota:
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. 113-134 - Gurij Ivanovich Marchuk:
On Numerical Solution of Poincaré Problem for Oceanic Circulations. 135- - Stefan Heinrich:
Complexity of Integral Equations and Relations to s-Numbers. 141-153 - Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Analytic Data. 154-170 - Peter Mathé:
On Optimal Random Nets. 171-180 - Christopher (Krzysztof) Sikorski, Chey-Woei Tsay, Henryk Wozniakowski:
An Ellipsoid Algorithm for the Computation of Fixed Points. 181-200
Volume 9, Number 2, June 1993
- Zvi Galil, Oded Margalit:
Witnesses for Boolean Matrix Multiplication and for Transitive Closure. 201-221 - Vitaly Maiorov:
Average n-Widths of the Wiener Space in the Linfinity-Norm. 222-230 - Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
On Randomized Semi-algebraic Test Complexity. 231-251 - Anargyros Papageorgiou:
Integration of Monotone Functions of Several Variables. 252-268 - Masao Iri:
A Proof of the Polynomiality of the Iri-Imai Method. 269-290 - Spassimir H. Paskov:
Average Case Complexity of Multivariate Integration for Smooth Functions. 291-312 - Sergei V. Pereverzev, Sergei G. Solodky:
On Optimization of Direct Methods of Solving Weakly Singular Integral Equations. 313-325 - Grzegorz W. Wasilkowski, Henryk Wozniakowski:
There Exists a Linear Problem with Infinite Combinatory Complexity. 326-337
Volume 9, Number 3, September 1993
- Dany Breslauer, Zvi Galil:
Efficient Comparison Based String Matching. 339-365 - Klaus Meer:
Real Number Models under Various Sets of Operations. 366-372 - Feng Gao, Grzegorz W. Wasilkowski:
On Detecting Regularity of Functions: A Probabilistic Analysis. 373-386 - Victor Y. Pan, James Demmel:
A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem. 387-405 - B. K. Natarajan:
Condition-Sensitive Computation of Approximate Fixed Points. 406-411 - S. Perfilov:
Choosing Optimal Parameters in Iterative Processes. 412-425
Volume 9, Number 4, December 1993
- Mario Milanese, Antonio Vicino:
Information-Based Complexity and Nonparametric Worst-Case System Identification. 427-446 - Hans Strauss:
Variational Principles in Curve Design. 447-457 - Leszek Plaskota:
A Note on Varying Cardinality in the Average Case Setting. 458-470 - Joos Heintz, Jacques Morgenstern:
On the Intrinsic Complexity of Elimination Theory. 471-498 - Aaron J. Shenhar:
On the Kolmogorov Complexity of Arbitrary Objects. 499-517
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 2025-12-19 21:02 CET 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:
