Pages that link to "Item:Q1344618"
From MaRDI portal
The following pages link to Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618):
Displaying 17 items.
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Efficient rational proofs with strong utility-gap guarantees (Q1617659) (← links)
- Efficient checking of polynomials and proofs and the hardness of approximation problems (Q1906841) (← links)
- Optimal Proximity Proofs Revisited (Q2794513) (← links)
- Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation'' (Q2817678) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- (Q3113771) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model (Q3525105) (← links)
- Probabilistic checking of proofs (Q3841041) (← links)
- Probabilistic checking of proofs; a new characterization of NP (Q4230321) (← links)
- Proof verification and hardness of approximation problems (Q4230322) (← links)
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results (Q4388899) (← links)
- How NP got a new definition: A survey of probabilistically checkable proofs (Q4549231) (← links)
- Verified Approximation Algorithms (Q5049009) (← links)
- On the concrete efficiency of probabilistically-checkable proofs (Q5495829) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5892265) (← links)