Pages that link to "Item:Q2817678"
From MaRDI portal
The following pages link to Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation'' (Q2817678):
Displaying 9 items.
- Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures'' (Q797300) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Corrigendum: Optimal asymptotic cloning machines (2014<i>New J. Phys.</i><b>16</b>063005) (Q3387473) (← links)
- Correction: Inference and Auditing: The Stringer Bound (Q4850137) (← links)
- Corrigendum to ‘Mixing, Communication Complexity and Conjectures of Gowers and Viola’ (Q5373838) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
