Quasi-polynomial tractability
Authors:
- 1 June 2011
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 27 (3-4) , 312-330
Abstract
No abstract availableKeywords
Funding Information
- German Science Foundation DFG (GN 91/4-1)
- National Science Foundation
This publication has 10 references indexed in Scilit:
- On the tractability of linear tensor product problems in the worst caseJournal of Complexity, 2009
- Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted TractabilityFoundations of Computational Mathematics, 2009
- The power of standard information for multivariate approximation in the randomized settingMathematics of Computation, 2006
- Generalized tractability for multivariate problems Part IJournal of Complexity, 2006
- Quasi-Monte Carlo methods can be efficient for integration over products of spheresJournal of Complexity, 2004
- Finite-order weights imply tractability of linear multivariate problemsJournal of Approximation Theory, 2004
- Worst case complexity of multivariate Feynman–Kac path integrationJournal of Complexity, 2003
- Tractability of Multivariate Integration for Periodic FunctionsJournal of Complexity, 2001
- Intractability Results for Integration and DiscrepancyJournal of Complexity, 2001
- Tractability and Strong Tractability of Linear Multivariate ProblemsJournal of Complexity, 1994