next up previous
Next: On Chosen Ciphertext Security Up: Back at Weizmann (1998-2003) Previous: Universal arguments and their

Using the FGLSS-reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs

This work demonstrates the applicability of the FGLSS-reduction in the context of reductions among combinatorial optimization problems.


Comments: Authored by O. Goldreich. Appeared in

ECCC, TR01-102, 2001.



Oded Goldreich
2003-07-30