✦ LIBER ✦

Average Case Complexity of Multivariate Integration for Smooth Functions

✍ Scribed by S.H. Paskov

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 633 KB
Volume: 9
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1993.1019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integration and Approximation of Multiva

Integration and Approximation of Multivariate Functions: Average Case Complexity with Isotropic Wiener Measure

✍ G.W. Wasilkowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Average Case Complexity of Multivariate

Average Case Complexity of Multivariate Integration and Function Approximation: An Overview

✍ G.W. Wasilkowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Average Case Complexity of Weighted Appr

Average Case Complexity of Weighted Approximation and Integration over R+

✍ Leszek Plaskota; Klaus Ritter; Grzegorz W. Wasilkowski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Tractability of Multivariate Integration

Tractability of Multivariate Integration for Periodic Functions

✍ Fred J. Hickernell; Henryk Woźniakowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Average-case complexity distributions: a

Average-case complexity distributions: a generalization of the Woz̀niakowski lemma for multidimensional numerical integration

✍ Ronald Kleiss 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 658 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent