Login / Signup
Hard Languages in $\mathsf{NP} \cap \mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness.
Riddhi Ghosal
Yuval Ishai
Alexis Korb
Eyal Kushilevitz
Paul Lou
Amit Sahai
Published in:
IACR Cryptol. ePrint Arch. (2023)
Keyphrases
</>
np complete
np hard
computational complexity
conjunctive queries
expressive power
decision problems
theorem proving
optimal solution
semi structured
text mining
theorem prover
structured data
databases
computer programs
data complexity
np hardness
conp complete
learning theory