default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 12
Volume 12, Number 1, March 1996
- Editorial. 1-
- Announcement: Best Paper Award. 3-
- Carsten Katscher, Erich Novak, Knut Petras:
Quadrature Formulas for Multivariate Convex Functions. 5-16 - Karin Frank, Stefan Heinrich, Sergei V. Pereverzev
:
Information Complexity of Multivariate Fredholm Integral Equations in Sobolev Classes. 17-34 - Konstantin Yu. Osipenko:
Optimal Recovery of Periodic Functions from Fourier Coefficients Given with an Error. 35-46 - Vitaly Maiorov:
About Widths of Wiener Space in the Lq-Norm. 47-57 - Yu. A. Farkov:
n-Widths, Faber Expansion, and Computation of Analytic Functions. 58-79
Volume 12, Number 2, June 1996
- C. Andrew Neff, John H. Reif:
An Efficient Algorithm for the Complex Roots Problem. 81-115 - J. Maurice Rojas, Xiaoshen Wang:
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes. 116-133 - Ioannis Z. Emiris:
On the Complexity of Sparse Elimination. 134-166 - Gilbert Stengle:
Complexity Estimates for the Schmu"dgen Positivstellensatz. 167-174 - Leszek Plaskota:
How to Benefit from Noise. 175-184
Volume 12, Number 3, September 1996
- Note From the Editor. 185-
- Harald Niederreiter, Michael Vielhaber:
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences. 187-198 - Erich Novak:
On the Power of Adaption. 199-237 - Mauro Leoncini:
On Speed versus Accuracy: Some Case Studies. 239-253
Volume 12, Number 4, December 1996
- Felipe Cucker, Michael Shub:
EDITOR'S FOREWORD. 255-256 - Grzegorz W. Wasilkowski:
Average Case Complexity of Multivariate Integration and Function Approximation: An Overview. 257-272 - Pascal Koiran:
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy. 273-286 - Karin Frank, Stefan Heinrich:
Computing Discrepancies of Smolyak Quadrature Rules. 287-314 - Peter Hertling:
Topological Complexity with Continuous Operations. 315-338 - Karl-Heinz Küfer:
On the Expected Number of Shadow Vertices of the Convex Hull of Random Points. 339-357 - Erich Novak, Ingo Roschmann:
Numerical Integration of Peak Functions. 358-379 - Erich Novak, Henryk Wozniakowski:
Topological Complexity of Zero-Finding. 380-400 - Sergei V. Pereverzev, Sergei G. Solodky:
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind. 401-415 - Leszek Plaskota:
Worst Case Complexity of Problems with Random Information Noise. 416-439 - Arthur G. Werschulz:
The Complexity of Definite Elliptic Problems with Noisy Data. 440-473 - Shinji Mizuno, Nimrod Megiddo, Takashi Tsuchiya:
A Linear Programming Instance with Many Crossover Events. 474-479 - Yinyu Ye:
How Partial Knowledge Helps to Solve Linear Programs. 480-491 - Dario Bini, Victor Y. Pan:
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors. 492-511 - John Dalbec:
An Algebraic Proof of Barlet's Join Theorem. 512-526 - Laureano González-Vega, M'hammed El Kahoui:
An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve. 527-544 - Thomas Lickteig, Marie-Françoise Roy:
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. 545-571 - Victor Y. Pan, Myong-Hi Kim, Akimou Sadikou, Xiaohan Huang, Ailong Zheng:
On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors. 572-594 - Olivier Catoni:
Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. 595-623
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-12 22:54 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:
