Hardness of Approximation Between P and NP

Aviad Rubinstein

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2017-146
August 11, 2017

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-146.pdf

Advisor: Christos Papadimitriou


BibTeX citation:

@phdthesis{Rubinstein:EECS-2017-146,
    Author = {Rubinstein, Aviad},
    Title = {Hardness of Approximation Between P and NP},
    School = {EECS Department, University of California, Berkeley},
    Year = {2017},
    Month = {Aug},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-146.html},
    Number = {UCB/EECS-2017-146}
}

EndNote citation:

%0 Thesis
%A Rubinstein, Aviad
%T Hardness of Approximation Between P and NP
%I EECS Department, University of California, Berkeley
%D 2017
%8 August 11
%@ UCB/EECS-2017-146
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-146.html
%F Rubinstein:EECS-2017-146