Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Czasopismo: Journal Of Complexity
Liczba publikacji: 41
2018
2017
- Paweł Siedlecki, (s,t)-weak tractability of Euler and Wiener integrated processes, Journal Of Complexity 2017.zobacz w PBN
- P. Kritzer, F. Pillichshammer i Henryk Woźniakowski, L∞-Approximation in Korobov spaces with exponential weights, Journal Of Complexity 41 2017, s. 102–125.zobacz w PBN
- A. Papageorgiou, I. Petras i Henryk Woźniakowski, (s,lnκ)-weak tractability of linear problems, Journal Of Complexity 40 2017, s. 1–16.zobacz w PBN
- A.G. Werschulz i Henryk Woźniakowski, A new characterization of (s,t)-weak tractability, Journal Of Complexity 38 2017, s. 68–79.zobacz w PBN
- A. Hinrichs, E. Novak, M. Ullrich i Henryk Woźniakowski, Product rules are optimal for numerical integration in classical smoothness spaces, Journal Of Complexity 38 2017, s. 39–49.zobacz w PBN
2016
2014
2013
2012
2011
- M. Gnewuch i Henryk Woźniakowski, Quasi-polynomial tractability, Journal Of Complexity 27 (3-4) 2011, s. 312–330.zobacz w PBN
- E. Novak i Henryk Woźniakowski, Lower bounds on the complexity for linear functionals in the randomized setting, Journal Of Complexity 27 (1) 2011, s. 1–22.zobacz w PBN
- Wojciech Niemiro i Krzysztof Łatuszyński, Rigorous confidence bounds for MCMC under drift condition, Journal Of Complexity 27 2011, s. 23–38.zobacz w PBN
- Henryk Woźniakowski i G. Wasilkowski, Liberating the dimension for function approximation, Journal Of Complexity 27 (1) 2011, s. 86–110.zobacz w PBN
- Henryk Woźniakowski i G. Wasilkowski, Liberating the dimension for function approximation: Standard information, Journal Of Complexity 27 (5) 2011, s. 417–440.zobacz w PBN
- Leszek Plaskota i Grzegorz Wasilkowski, Tractability of infinite-dimensional integration in the worst case and randomized settings, Journal Of Complexity 27 (6) 2011, s. 505–518.zobacz w PBN
2010
2009
2008
2007
2005
2004
- Henryk Woźniakowski i Marek Kwas, Sharp error bounds on quantum Boolean summation in various setting, Journal Of Complexity 20 (5) 2004, s. 669–698.zobacz w PBN
- I Sloan, X Wang i Henryk Woźniakowski, Finite-order weights impty tractability of multivariate integration, Journal Of Complexity 20 2004, s. 46–74.zobacz w PBN
- J Dick, I Sloan, X Wang i Henryk Woźniakowski, Liberating the weights, Journal Of Complexity 20 (5) 2004, s. 593–623.zobacz w PBN
- Leszek Plaskota, Klaus Ritter i Grzegorz Wasilkowski, Optimal designs for weighted approximation and integration of stochastic processes on R_+, Journal Of Complexity 20 (1) 2004, s. 108–131.zobacz w PBN
2003
2002
- Leszek Plaskota, K Ritter i G Wasilkowski, A verage case complexity of weighted approximation and integration over R., Journal Of Complexity 18 2002, s. 517–544.zobacz w PBN
- Henryk Woźniakowski i I Sloan, Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces., Journal Of Complexity 18 2002, s. 479–499.zobacz w PBN
- Henryk Woźniakowski i A Werschulz, What is the complexity of volume calculation?, Journal Of Complexity 18 (2) 2002, s. 660–678.zobacz w PBN
2001
- Leszek Plaskota i Mark Kon, Complexity of neural network approximation with limited information: a worst case approach., Journal Of Complexity 17 (2) 2001, s. 345–365.zobacz w PBN
- Henryk Woźniakowski i Erich Novak, Intractability results for integration and discrepancy., Journal Of Complexity 17 (2) 2001, s. 388–441.zobacz w PBN
- Henryk Woźniakowski i A Werschulz, What is the complexity of surface integration?, Journal Of Complexity 17 (2) 2001, s. 442–466.zobacz w PBN
- Henryk Woźniakowski i David Lee, A probabilistic analysis of linear operator testing., Journal Of Complexity 17 2001, s. 516–540.zobacz w PBN
2000