𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Compression of Samplable Sources
✍ Luca Trevisan; Salil Vadhan; David Zuckerman πŸ“‚ Article πŸ“… 2005 πŸ› Springer 🌐 English βš– 372 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