Title of article :
On bounded occurrence constraint satisfaction
Author/Authors :
Johan H?stad، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2000
Keywords :
Approximation algorithms , analysis of algorithms , computational complexity
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters