Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness.
Riddhi GhosalYuval IshaiAlexis KorbEyal KushilevitzPaul LouAmit SahaiPublished in: STOC (2023)
Keyphrases
- np complete
- computational complexity
- np hard
- expressive power
- conjunctive queries
- decision problems
- conp complete
- data complexity
- semi structured
- theorem prover
- computer programs
- language independent
- theorem proving
- random instances
- mathematical proofs
- structured data
- target language
- multi lingual
- databases
- cross lingual
- satisfiability problem
- phase transition
- text summarization
- language model
- worst case
- equational theories