Part of the Lecture Notes in Computer Science book series (LNCS, volume 1367)
Deriving non-approximability results by reductions
KeywordsBoolean Function Auxiliary Variable Constraint Function Constraint Satisfaction Problem Satisfying Assignment
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag 1998