✦ LIBER ✦

Pseudorandomness and Average-Case Complexity Via Uniform Reductions

✍ Scribed by Luca Trevisan; Salil Vadhan

Publisher: Springer
Year: 2007
Tongue: English
Weight: 368 KB
Volume: 16
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-007-0233-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relations between Average-Case and Worst

Relations between Average-Case and Worst-Case Complexity

✍ A. Pavan; N. V. Vinodchandran 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 329 KB

Complexity of the Bollobás–Riordan Polyn

Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions

✍ Markus Bläser; Holger Dell; Johann A. Makowsky 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 474 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

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

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

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