| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Linear Programming Instance with Many Crossover Events
|
Mizuno, Shinji
|
|
1996
|
12 |
4 |
p. 474-479
6 p.
|
artikel
|
| 2 |
An Algebraic Proof of Barlet's Join Theorem
|
Dalbec, John
|
|
1996
|
12 |
4 |
p. 512-526
15 p.
|
artikel
|
| 3 |
An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
|
González-Vega, Laureano
|
|
1996
|
12 |
4 |
p. 527-544
18 p.
|
artikel
|
| 4 |
Author Index for Volume 12
|
|
|
1996
|
12 |
4 |
p. 624-
1 p.
|
artikel
|
| 5 |
Average Case Complexity of Multivariate Integration and Function Approximation
|
Wasilkowski, G.W.
|
|
1996
|
12 |
4 |
p. 257-272
16 p.
|
artikel
|
| 6 |
Computing Discrepancies of Smolyak Quadrature Rules
|
Frank, Karin
|
|
1996
|
12 |
4 |
p. 287-314
28 p.
|
artikel
|
| 7 |
EDITOR'S FOREWORD
|
Cucker, Felipe
|
|
1996
|
12 |
4 |
p. 255-256
2 p.
|
artikel
|
| 8 |
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors
|
Bini, Dario
|
|
1996
|
12 |
4 |
p. 492-511
20 p.
|
artikel
|
| 9 |
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy
|
Koiran, Pascal
|
|
1996
|
12 |
4 |
p. 273-286
14 p.
|
artikel
|
| 10 |
How Partial Knowledge Helps to Solve Linear Programs
|
Ye, Yinyu
|
|
1996
|
12 |
4 |
p. 480-491
12 p.
|
artikel
|
| 11 |
Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments
|
Catoni, Olivier
|
|
1996
|
12 |
4 |
p. 595-623
29 p.
|
artikel
|
| 12 |
Numerical Integration of Peak Functions
|
Novak, Erich
|
|
1996
|
12 |
4 |
p. 358-379
22 p.
|
artikel
|
| 13 |
On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors
|
Pan, Victor Y.
|
|
1996
|
12 |
4 |
p. 572-594
23 p.
|
artikel
|
| 14 |
On the Expected Number of Shadow Vertices of the Convex Hull of Random Points
|
Küfer, K.-H.
|
|
1996
|
12 |
4 |
p. 339-357
19 p.
|
artikel
|
| 15 |
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders
|
Lickteig, Thomas
|
|
1996
|
12 |
4 |
p. 545-571
27 p.
|
artikel
|
| 16 |
The Complexity of Definite Elliptic Problems with Noisy Data
|
Werschulz, Arthur G.
|
|
1996
|
12 |
4 |
p. 440-473
34 p.
|
artikel
|
| 17 |
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind
|
Pereverzev, S.V.
|
|
1996
|
12 |
4 |
p. 401-415
15 p.
|
artikel
|
| 18 |
Topological Complexity of Zero-Finding
|
Novak, Erich
|
|
1996
|
12 |
4 |
p. 380-400
21 p.
|
artikel
|
| 19 |
Topological Complexity with Continuous Operations
|
Hertling, Peter
|
|
1996
|
12 |
4 |
p. 315-338
24 p.
|
artikel
|
| 20 |
Worst Case Complexity of Problems with Random Information Noise
|
Plaskota, Leszek
|
|
1996
|
12 |
4 |
p. 416-439
24 p.
|
artikel
|
Tijdschrift beschrijving