Journal of Complexity logo Academic Press logo

Publisher: Academic Press

Related content
Volume 18, Number 2, June 2002

< previous issue | all issues | next issue >

Dagstuhl 2000
pp. 393-393(1)
Authors: Pereverzev S.V.; Wasilkowski G.W.

Linear vs Standard Information for Scalar Stochastic Differential Equations
pp. 394-414(21)
Authors: Hofmann N.; Müller-Gronbach T.; Ritter K.

On the L2-Discrepancy of the Sobol–Hammersley Net in Dimension 3
pp. 415-448(34)
Authors: Larcher G.; Pillichshammer F.

Direct Estimation of Linear Functionals from Indirect Noisy Observations
pp. 500-516(17)
Authors: Mathé P.; Pereverzev S.V.

Average Case Complexity of Weighted Approximation and Integration over Ropf+
pp. 517-544(28)
Authors: Plaskota L.; Ritter K.; Wasilkowski G.W.

Joint AMS–SIAM Conference
pp. 545-546(2)
Authors: Allgower E.; Georg K.; Sikorski C.

Piecewise Linear Approximation of Smooth Compact Fibers
pp. 547-556(10)
Authors: Allgower E.L.; Sommese A.J.

On the Complexity of Exclusion Algorithms for Optimization
pp. 573-588(16)
Authors: Allgower E.; Erdmann M.; Georg K.

Verifying Topological Indices for Higher-Order Rank Deficiencies
pp. 589-611(23)
Authors: Baker Kearfott R.; Dian J.

On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree
pp. 612-640(29)
Authors: Mourrain B.; Vrahatis M.N.; Yakoubsohn J.C.

A Two-Dimensional Bisection Envelope Algorithm for Fixed Points
pp. 641-659(19)
Authors: Shellman S.; Sikorski K.

What Is the Complexity of Volume Calculation?
pp. 660-678(19)
Authors: Werschulz A.G.; Wozacuteniakowski H.

< previous issue | all issues | next issue >

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page