J. Hastad. Clique is Hard to Approximate within n to the power 1epsilon, Acta Mathematica, Vol 182, 1999, pp 105-142. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Distance-2 Matching Problem and its.. - Balakrishnan.. (1 citation) (Correct)
No context found.
J. Hastad. Clique is Hard to Approximate within n to the power 1epsilon, Acta Mathematica, Vol 182, 1999, pp 105-142.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC