Golovnev, Alexander; Haviv, Ishay The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications. (English) Zbl 07640716 Theory Comput. 18, Paper No. 22, 22 p. (2022). MSC: 68Qxx 05C50 68Q06 68Q17 68R10 PDFBibTeX XMLCite \textit{A. Golovnev} and \textit{I. Haviv}, Theory Comput. 18, Paper No. 22, 22 p. (2022; Zbl 07640716) Full Text: DOI arXiv
Haviv, Ishay; Regev, Oded Tensor-based hardness of the shortest vector problem to within almost polynomial factors. (English) Zbl 1253.68152 Theory Comput. 8, Paper No. 23, 513-531 (2012). MSC: 68Q17 52C07 11H06 11H31 05B40 PDFBibTeX XMLCite \textit{I. Haviv} and \textit{O. Regev}, Theory Comput. 8, Paper No. 23, 513--531 (2012; Zbl 1253.68152) Full Text: DOI arXiv
Haviv, Ishay; Regev, Oded; Ta-Shma, Amnon On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy. (English) Zbl 1213.68311 Theory Comput. 3, Paper No. 3, 45-60 (2007). MSC: 68Q17 03D15 68Q15 PDFBibTeX XMLCite \textit{I. Haviv} et al., Theory Comput. 3, Paper No. 3, 45--60 (2007; Zbl 1213.68311) Full Text: DOI arXiv