Complexity of multivariate problems based on binary information Conference Paper

abstract

• 2017 IEEE. This note suggests some investigations about the complexity of multivariate problems based on quantized information rather than standard information. The extreme case of binary information is studied on two classical examples: the integration of multivariate Lipschitz functions, for which it is shown that adaptivity of the quantization process is beneficial, and the integration of multivariate trigonometric polynomials, for which it is hinted that special binary information is superior to standard binary information.

name of conference

• 2017 International Conference on Sampling Theory and Applications (SampTA)

authors

• Foucart, Simon

published proceedings

• 2017 INTERNATIONAL CONFERENCE ON SAMPLING THEORY AND APPLICATIONS (SAMPTA)

author list (cited authors)

• Foucart, S.

citation count

• 0

complete list of authors

• Foucart, Simon

publication date

• January 2017

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

Digital Object Identifier (DOI)

• 10.1109/sampta.2017.8024351

International Standard Book Number (ISBN) 13

• 9781538615652

start page

• 227

end page

• 230

URL

• http://dx.doi.org/10.1109/sampta.2017.8024351