Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 10
Volume 10, Number 1, March 1994
- James Renegar:
Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers. 1-56
- Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy:
Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. 57-63 - Ron Shonkwiler, Erik S. Van Vleck
:
Parallel Speed-Up of Monte Carlo Methods for Global Optimization. 64-95 - Henryk Wozniakowski:
Tractability and Strong Tractability of Linear Multivariate Problems. 96-128 - Karl Heinz Borgwardt, Jürgen Brzank:
Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. 129-141 - Adam W. Bojanczyk, Georg Heinig:
A Multi-step Algorithm for Hankel Matrices. 142-164 - Yaser S. Abu-Mostafa:
Learning from Hints. 165-178
Volume 10, Number 2, June 1994
- Zhi-Quan Luo:
One-Way Communication Complexity of Computing a Collection of Rational Functions. 179-198 - Florian A. Potra:
Efficient Hybrid Algorithms for Finding Zeros of Convex Functions. 199-215 - Moshe Dror, Benjamin T. Smith, Martin Trudeau:
Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems. 216-229 - Jun Gao, J. Michael Steele:
General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem. 230-245 - Steven A. Moyer, William A. Wulf:
Modeling Optimal Effective Bandwidth of Page-Mode Memory for Stream-Oriented Computations. 246-264 - Nikolaj P. Korneichuk:
Optimization of Active Algorithms for Recovery of Monotonic Functions from Hölder's Class. 265-269
Volume 10, Number 3, September 1994
- Yinyu Ye:
Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions. 271-280 - Boris Ryabko:
The Complexity and Effectiveness of Prediction Algorithms. 281-295 - Paola Favati, Grazia Lotti, Gaspare Di Marco, Francesco Romani:
Asymptotic Behavior of Automatic Quadrature. 296-340 - Nicholas N. Vakhania:
On Boundary Value Problems for the Hyperbolic Case. 341-355 - Mark A. Kon:
On the delta->0 Limit in Probabilistic Complexity. 356-365
Volume 10, Number 4, December 1994
- Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data. 367-383 - Sung Hee Choi:
Probabilistic Analysis of Simpson's Quadrature. 384-410 - Israel Gohberg, Vadim Olshevsky:
Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems. 411-427 - Yongsheng Sun, Chengyong Wang:
mu-Average n-Widths on the Wiener Space. 428-436 - Chi Tat Chong:
Positive Reducibility of the Interior of Filled Julia Sets. 437-444 - Ming Chu:
There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity. 445-450 - Arkadi Nemirovski:
On Parallel Complexity of Nonsmooth Convex Optimization. 451-463
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-06 22:41 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:
