A new criterion for tractability of multivariate problems

Anargyros Papageorgiou, Iasonas Petras

Research output: Contribution to journalArticle

17 Scopus citations

Abstract

Tractability of multivariate problems studies their complexity with respect to the number of variables, d, and the accuracy of the solution ε. Different types of tractability have been used, such as polynomial tractability and weak tractability and others. These tractability types, however, do not express the complexity with respect to the number of bits of accuracy. We introduce two new tractability types, polylog tractability and ln κ-weak tractability. A problem is polylog tractable iff its complexity is polynomial in d and in lnε-1, while a problem is lnκ-weakly tractable iff its complexity is not exponential in d and lnκε-1, for some κ≠¥ 1. We study general multivariate problems and multivariate tensor product problems. We provide necessary and sufficient conditions for the respective tractability types. Moreover, we show that a multivariate tensor product problem cannot be polylog tractable and cannot be ln1-weakly tractable (i.e., with κ=1) unless it is trivial.

Original languageEnglish (US)
Pages (from-to)604-619
Number of pages16
JournalJournal of Complexity
Volume30
Issue number5
DOIs
StatePublished - Oct 2014
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Statistics and Probability
  • Numerical Analysis
  • Mathematics(all)
  • Control and Optimization
  • Applied Mathematics

Keywords

  • Complexity
  • Multivariate problem
  • Tractability

Fingerprint Dive into the research topics of 'A new criterion for tractability of multivariate problems'. Together they form a unique fingerprint.

  • Cite this