Lectures on Proof Verification and Approximation Algorithms by Ernst W. Mayr (En
69,04 €
To the theory of complexity and approximation algorithms. - to randomized algorithms. - Proof checking and non-approximability. - Proving the PCP-Theorem. - Parallel repetition of MIP(2,1) systems.
Jetzt bei Ebay: