AAAAAA

   
Results: 1-11 |
Results: 11

Authors: Lee, D Wozniakowski, H
Citation: D. Lee et H. Wozniakowski, A probabilistic analysis of linear operator testing, J COMPLEX, 17(3), 2001, pp. 516-540

Authors: Novak, E Wozniakowski, H
Citation: E. Novak et H. Wozniakowski, Intractability results for integration and discrepancy, J COMPLEX, 17(2), 2001, pp. 388-441

Authors: Werschulz, AG Wozniakowski, H
Citation: Ag. Werschulz et H. Wozniakowski, What is the complexity of surface integration?, J COMPLEX, 17(2), 2001, pp. 442-466

Authors: Lee, D Wozniakowski, H
Citation: D. Lee et H. Wozniakowski, Approximate evaluations of characteristic polynomials of Boolean functions, THEOR COMP, 262(1-2), 2001, pp. 37-68

Authors: Heinrich, S Novak, E Wasilkowski, GW Wozniakowski, H
Citation: S. Heinrich et al., The inverse of the star-discrepancy depends linearly on the dimension, ACT ARITH, 96(3), 2001, pp. 279-302

Authors: Wasilkowski, GW Wozniakowski, H
Citation: Gw. Wasilkowski et H. Wozniakowski, On the complexity of stochastic integration, MATH COMPUT, 70(234), 2001, pp. 685-698

Authors: Novak, E Wozniakowski, H
Citation: E. Novak et H. Wozniakowski, Complexity of linear problems with a fixed output basis, J COMPLEX, 16(1), 2000, pp. 333-362

Authors: Plaskota, L Wasilkowski, GW Wozniakowski, H
Citation: L. Plaskota et al., A new algorithm and worst case complexity for Feynman-Kac path integration, J COMPUT PH, 164(2), 2000, pp. 335-353

Authors: Wasilkowski, GW Wozniakowski, H
Citation: Gw. Wasilkowski et H. Wozniakowski, Weighted tensor product algorithms for linear multivariate problems, J COMPLEX, 15(3), 1999, pp. 402-447

Authors: Novak, E Wozniakowski, H
Citation: E. Novak et H. Wozniakowski, On the cost of uniform and nonuniform algorithms, THEOR COMP, 219(1-2), 1999, pp. 301-318

Authors: Wozniakowski, H
Citation: H. Wozniakowski, Why does information-based complexity use the real number model?, THEOR COMP, 219(1-2), 1999, pp. 451-465
Risultati: 1-11 |