<--- Back to Details
First PageDocument Content
Probabilistic complexity theory / Structural complexity theory / NP-complete problems / Approximation algorithms / 2-satisfiability / L-reduction / Reduction / PCP theorem / Probabilistically checkable proof / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2013-02-14 13:17:57
Probabilistic complexity theory
Structural complexity theory
NP-complete problems
Approximation algorithms
2-satisfiability
L-reduction
Reduction
PCP theorem
Probabilistically checkable proof
Theoretical computer science
Applied mathematics
Computational complexity theory

Approximation Algorithms (ADM III)

Add to Reading List

Source URL: www.coga.tu-berlin.de

Download Document from Source Website

File Size: 98,82 KB

Share Document on Facebook

Similar Documents

Un mariage écologique..? Oui, je le veux ! Voici la quatrième de six chroniques « éco-cadeaux » réalisées par le Conseil régional de l’environnement du Centre-du-Québec et visant à promouvoir la réduction d

DocID: 1vqTP - View Document

Neuroendocrinology Letters Volume 33 SupplA R T I C L E Effects of body fat reduction on plasma adipocyte fatty acid-binding protein concentration in

DocID: 1vg1D - View Document

Changing with the World U N D P S t r at e g i c P l a n : 20 1 4 – 1 7 Helping countries to achieve the simultaneous eradication of poverty and significant reduction of inequalities and exclusion

DocID: 1vevW - View Document

Communiqué de presse Paris, 17 novembre 2017 JeChange, leader dans la réduction des factures, annonce l’acquisition de Crédit Unique, courtier en

DocID: 1v6tl - View Document

DRAFT CCDF PREPRINT FOR PUBLIC COMMENTOMB Control No: Expiration date: XXXX THE PAPERWORK REDUCTION ACT OFPub. L)

DocID: 1uIDT - View Document