3 An NP Complete Language
نویسنده
چکیده
L = {x such that x is an acceptable Riemann Hypothesis proof} is in NP and therefore, using a reduction, we can come up with a circuit C that takes as input x and outputs 1 if x is a proof for the Riemann Hypothesis or 0 otherwise. Our goal now is to design a pair of PPT machines (Enc,Dec) such that: 1. Enc(C,m) takes as input the circuit C and m ∈ {0, 1} and outputs a ciphertext e ∈ {0, 1}∗. 2. Dec(C, e, w) takes as input the circuit C, the cipertext e and a witness w ∈ {0, 1}∗ and outputs m if if C(w) = 1 or ⊥ otherwise.
منابع مشابه
Strong Reductions and Isomorphism of Complete Sets
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. • If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. • If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomo...
متن کاملSparse Sets, Approximable Sets, and Parallel Queries to NP
We show that if an NP-complete set or a coNP-complete set is polynomial-time disjunc-tive truth-table reducible to a sparse set then FP NP jj = FP NP log]. With a similar argument we show also that if SAT is O(log n)-approximable then FP NP jj = FP NP log]. Since FP NP jj = FP NP log] implies that SAT is O(logn)-approximable BFT97], it follows from our result that the two hypotheses are equival...
متن کاملHamming Approximation of NP Witnesses
Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language. A d(n)-Hammingapproximation algorithm for the verifier is one that, given any member x of the language, outputs in polynomial time a string a with Hamming dis...
متن کاملOn an Optimal Quantiied Propositional Proof System and a Complete Language for Np \ Co-np
In this paper we prove that if there exists an optimal quan-tiied propositional proof system then there exists a complete language for NP \ co-NP.
متن کاملUniform Recognition for Acyclic Context-Sensitive Grammars is NP-complete
Context-sensitive grammars in which each rule is of the forln aZfl-~ (-*Tfl are acyclic if the associated context-free grammar with the rules Z ~ 3' is acyclic. The problem whether an intmt string is in the language generated by an acyclic context-sensitive grammar is NP-conlplete.
متن کاملSplitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the c...
متن کامل