Grzegorz Wasilkowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Grzegorz Wasilkowski has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Henryk Woźniakowski
Department of Computer Science Columbia University 10027 New York NY USA
3 shared publications
Latest Publications
- 29 April 2009
- Published by Allerton Press in Russian Mathematics
- Vol. 53 (4) , 1-14
A survey of average case complexity for linear multivariate problems
We survey recent results on the average case complexity for linear multivariate problems. Our emphasis is on problems defined on spaces of functions of d variables with large d. We present the sharp order of the average case complexity for a number of linear multivariate problems as well as necessary and sufficient conditions for the average case complexity not to be exponential in d.
- 29 April 2009
- Published by Allerton Press in Russian Mathematics
- Vol. 53 (4) , 1-14
A survey of average case complexity for linear multivariate problems
We survey recent results on the average case complexity for linear multivariate problems. Our emphasis is on problems defined on spaces of functions of d variables with large d. We present the sharp order of the average case complexity for a number of linear multivariate problems as well as necessary and sufficient conditions for the average case complexity not to be exponential in d.
- 1 January 2001
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 1 (4) , 417-434
On the Power of Standard Information for Weighted Approximation
- 1 January 2001
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 1 (4) , 417-434
On the Power of Standard Information for Weighted Approximation
- Open Access
- 1 July 1997
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (219) , 1125-1132
The exponent of discrepancy is at most 1.4778...
We study discrepancy with arbitrary weights in the L 2 L_2 norm over the d d -dimensional unit cube. The exponent p ∗ p^* of discrepancy is defined as the smallest p p for which there exists a positive number K K such that for all d d and all ε ≤ 1 \varepsilon \le 1 there exist K ε − p K\varepsilon ^{-p} points with discrepancy at most ε \varepsilon . It is well known that p ∗ ∈ ( 1 , 2 ] p^*\in (1,2] . We improve the upper bound by showing that \[ p ∗ ≤ 1.4778842. p^*\le 1.4778842. \] This is done by using relations between discrepancy and integration in the average case setting with the Wiener sheet measure. Our proof is not constructive. The known constructive bound on the exponent p ∗ p^* is 2.454 2.454 .
- 1 July 1997
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (219) , 1125-1132
Open AccessThe exponent of discrepancy is at most 1.4778...
We study discrepancy with arbitrary weights in the L 2 L_2 norm over the d d -dimensional unit cube. The exponent p ∗ p^* of discrepancy is defined as the smallest p p for which there exists a positive number K K such that for all d d and all ε ≤ 1 \varepsilon \le 1 there exist K ε − p K\varepsilon ^{-p} points with discrepancy at most ε \varepsilon . It is well known that p ∗ ∈ ( 1 , 2 ] p^*\in (1,2] . We improve the upper bound by showing that \[ p ∗ ≤ 1.4778842. p^*\le 1.4778842. \] This is done by using relations between discrepancy and integration in the average case setting with the Wiener sheet measure. Our proof is not constructive. The known constructive bound on the exponent p ∗ p^* is 2.454 2.454 .