期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1998
卷号：1998
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：A Uniform Generation procedure for NP is an
algorithm which given any input in a fixed NP-language, outputs a uniformly
distributed NP-witness for membership of the input in the language.
We present a Uniform Generation procedure for NP that runs in probabilistic
polynomial-time with an NP-oracle. This improves upon results of Jerrum,
Valiant and Vazirani, which either require a 2P oracle or obtain only
almost uniform generation. Our procedure utilizes ideas originating in the
works of Sipser, Stockmeyer, and Jerrum, Valiant and Vazirani
