Uniform Generation of NP-Witnesses Using an NP-Oracle
نویسندگان
چکیده
Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Erez Petrankz May 1998 Abstract A Uniform Generation procedure for NP is an algorithm which given any input in a xed 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 P2 oracle or obtain only almost uniform generation. Our procedure utilizes ideas originating in the works of Sipser, Stockmeyer, and Jerrum, Valiant and Vazirani.
منابع مشابه
Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles
In the present paper we prove that relative to random oracle A (with respect to the uniform measure) the following three assertions hold: (1) there is a pair of disjoint NP A-sets which are separable by no P A-set, (2) there is a pair of disjoint Co-NP A-sets which are separable by no P A-set and (3) there is an innnite Co-NP A-set having no innnite NP A-subset
متن کاملFormalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
Since the proof of the four color theorem in 1976, computergenerated proofs have become a reality in mathematics and computer science. During the last decade, we have seen formal proofs using verified proof assistants being used to verify the validity of such proofs. In this paper, we describe a formalized theory of size-optimal sorting networks. From this formalization we extract a certified c...
متن کاملUniversality for Nondeterministic Logspace
The notion of universality was introduced [AB92] in 1992 in the context of NP. The major motivation of the work was to capture in a theory the essential sameness of various NPcompleteness proofs. The approach was to find out precisely what is preserved by natural reductions. When we wish to show that a language A polynomial time, many-one reduces to an NP-complete language B vis a reduction f ,...
متن کاملRelative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity classes. Lutz has proposed the hypothesis that NP does not have p-measure zero, meaning loosely that NP contains a non-negligible subset of exponential time. This hypothesis implies a strong separation of P from NP and is ...
متن کاملNP - sets are Co - NP - immune Relative to aRandom
We prove that the class NP has Co-NP-immune sets relative to a random oracle. Moreover, we prove that, relative to a random oracle, there are L 2 P and NP-set L 1 L such that L 1 is Co-NP-immune and L n L 1 is NP-immune. The second theorem implies the theorem in 4] that Co-NP has NP-immune sets relative to a random oracle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 163 شماره
صفحات -
تاریخ انتشار 1998