Information-based complexity
The complexity of dynamic programming
Journal of Complexity
The computational complexity of differential and integral equations: an information-based approach
The computational complexity of differential and integral equations: an information-based approach
Average case complexity of linear multivariate problems I: theory
Journal of Complexity
Average case complexity of linear multivariate problems II: applications
Journal of Complexity
The real number model in numerical analysis
Journal of Complexity
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Complexity and information
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Dynamic Programming
| Hi-index | 0.00 |
This issue's guest column, by Art Werschulz, is on information-based computation. Given that this arrived during the first half of December 2000, Art clearly deserves a heroic focus award for making the time to write such a wonderful column while every news cycle was filled with the ups and downs of a presidential post-election adventure the likes of which is not likely to be seen again in any of our lifetimes.Upcoming complexity theory columns include articles by: J. Castro, R. Gavaldà, and D. Guijarro; S. Ravi Kumar and D. Sivakumar; R. Paturi; and M. Holzer and P. McKenzie.