Hardness of approximating the shortest vector problem in lattices
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
On the power of unique 2-prover 1-round games
Optimal Inapproximability Results for MAX?CUT and Other 2?Variable CSPs?
Vertex cover might be hard to approximate to within <mml:math altimg=“si1.gif” overflow=“scroll” xmlns:xocs=“http://www.elsevier.com/xml/xocs/dtd” xmlns:xs=“http://www.w3.org/2001/XMLSchema” xmlns:xsi=“http://www.w3.org/2001/XMLSchema-instance” xmlns=“http://www.elsevier.com/xml/ja/dtd” xmlns:ja=“http://www.elsevier.com/xml/ja/dtd” xmlns:mml=“http://www.w3.org/1998/Math/MathML” xmlns:tb=“http://www.elsevier.com/xml/common/table/dtd” xmlns:sb=“http://www.elsevier.com/xml/common/struct-bib/dtd” xmlns:ce=“http://www.elsevier.com/xml/common/dtd” xmlns:xlink=“http://www.w3.org/1999/xlink” xmlns:cals=“http://www.elsevier.com/xml/common/cals/dtd”><mml:mn>2</mml:mn><mml:mo>?</mml:mo><mml:mi>?</mml:mi></mml:math>
On the hardness of learning intersections of two halfspaces
SIAM Journal on Computing
Journal of the ACM
Journal of Computer and System Sciences
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Rishi Saket
Parikshit Gopalan
Ryan O’Donnell
Elchanan Mossel
Oded Regev
Guy Kindler
(Gap/S)ETH hardness of SVP
Bypassing UGC from Some Optimal Geometric Inapproximability Results