Search Results
12. Computational complexity of continuous problems
13. Estimating a largest eigenvector by polynomial algorithms with a random start
14. Overview of information-based complexity
15. The exponent of discrepancy is at most 1.4778 . . .
16. An intractability result for multiple integration
17. On tractability of path integration
18. Strong tractability of weighted tensor products
19. Explicit cost bounds of algorithms for multivariate tensor product problems
20. The Monte Carlo Algorithm With a Pseudorandom Generator
- « Previous
- Next »
- 1
- 2
- 3
- 4