The following pages link to (Q5694913):
Displaying 9 items.
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← links)
- Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation'' (Q2817678) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Hard-core theorems for complexity classes (Q3769964) (← links)
- (Q4005200) (← links)
- (Q4671210) (← links)
- Complexity Approximation Principle (Q4933950) (← links)