The following pages link to (Q4234093):
Displaying 9 items.
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- Some recent strong inapproximability results (Q5054856) (← links)
