On average case complexity of linear problems with noisy information
نویسندگان
چکیده
منابع مشابه
Average Case Complexity of Linear Multivariate Problems Part Ii: Applications
We apply the theoretical results of Part I to linear multivariate problems LMP equipped with the folded Wiener sheet measure. We are particularly interested in multivariate weighted integration and multivariate function approximation. We prove that any LMP which satisses (A.1) of Part I is tractable and its exponent is at most 2. We show that optimal or nearly optimal sample points can be deriv...
متن کاملA Survey of Average Case Complexity for Linear Multivariate Problems*
We survey recent results on the average case complexity for linear multivariate problems. Our emphasis is on problems defined on spaces of functions of d variables with large d. We present the sharp order of the average case complexity for a number of linear multivariate problems as well as necessary and sufficient conditions for the average case complexity not to be exponential in d. DOI: 10.3...
متن کاملAverage Case Complexity of Linear Multivariate
We study the average case complexity of a linear multivariate problem (LMP) defined on functions of d variables. We consider two classes of information. The first Λ std consists of function values and the second Λ all of all continuous linear functionals. Tractability of LMP means that the average case complexity is O((1/ε) p) with p independent of d. We prove that tractability of an LMP in Λ s...
متن کاملAverage-case complexity of shortest-paths problems
We study both upper and lower bounds on the average-case complexity of shortestpaths algorithms. It is proved that the all-pairs shortest-paths problem on n-vertex networks can be solved in time O(n2 logn) with high probability with respect to various probability distributions on the set of inputs. Our results include the first theoretical analysis of the average behavior of shortest-paths algo...
متن کاملOn the Average Case Complexity of Some P-complete Problems
We show that some classical P-complete problems can be solved efficiently in average NC. The probabilistic model we consider is the sample space of input descriptions of the problem with the underlying distribution being the uniform one. We present parallel algorithms that use a polynomial number of processors and have expected time upper bounded by (eIn4 + o(l))logn, asymptotically with high p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1990
ISSN: 0885-064X
DOI: 10.1016/0885-064x(90)90007-z