✦ LIBER ✦

Polynomial Time Samplable Distributions

✍ Scribed by Tomoyuki Yamakami

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 234 KB
Volume: 15
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0523

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete problems withL-samplable distri

Complete problems withL-samplable distributions

✍ Per Grape 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 702 KB

Compression of Samplable Sources

✍ Luca Trevisan; Salil Vadhan; David Zuckerman 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 372 KB

Distributions of polynomial forms

✍ A. Basalykas 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 593 KB

Multiple Comparisons of Polynomial Distr

Multiple Comparisons of Polynomial Distributions

✍ Dr. Th. Royen 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Choiceless polynomial time

✍ Andreas Blass; Yuri Gurevich; Saharon Shelah 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Turing machines deÿne polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures a

Polynomial Time Introreducibility

✍ Cintioli; Silvestri 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 133 KB