Skip navigation
Skip navigation

On tractability of approximation in special function spaces

Hegland, Markus; Wasilkowski, G.W.

Description

We consider approximation problems for a special space of d variate functions. We show that the problems have small number of active variables, as it has been postulated in the past using concentration of measure arguments. We also show that, depending on the norm for measuring the error, the problems are strongly polynomially or quasi-polynomially tractable even in the model of computation where functional evaluations have the cost exponential in the number of active variables.

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
URI: http://hdl.handle.net/1885/69676
Source: Journal of Complexity
DOI: 10.1016/j.jco.2012.10.002

Download

File Description SizeFormat Image
01_Hegland_On_tractability_of_2013.pdf274.04 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator