Pages that link to "Item:Q1854397"
From MaRDI portal
The following pages link to Uniform generation of NP-witnesses using an NP-oracle (Q1854397):
Displaying 9 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- Advanced SMT techniques for weighted model integration (Q2321319) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- On Pseudodeterministic Approximation Algorithms. (Q5005164) (← links)
