%0 Conference Paper
%B Proceedings of the thirty-second annual ACM symposium on Theory of computing
%D 2000
%T The value of strong inapproximability results for clique
%A Srinivasan, Aravind
%K P vs. NP
%K Approximation algorithms
%K Clique
%K inapproximabilit
%K Independent set
%K Packing integer programs
%K random sampling
%B Proceedings of the thirty-second annual ACM symposium on Theory of computing
%S STOC '00
%I ACM
%C New York, NY, USA
%P 144 - 152
%8 2000///
%@ 1-58113-184-4
%G eng
%U http://doi.acm.org/10.1145/335305.335322
%R 10.1145/335305.335322