The following pages link to Ishay Haviv (Q1006406):
Displaying 50 items.
- A note on the distribution of the distance from a lattice (Q1006407) (← links)
- Dioid partitions of groups (Q1663807) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- The binary rank of circulant block matrices (Q2093516) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824) (← links)
- H-wise independence (Q2986900) (← links)
- On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (Q3002779) (← links)
- The Remote Set Problem on Lattices (Q3167395) (← links)
- (Q3549646) (← links)
- The Euclidean Distortion of Flat Tori (Q3588410) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q4575599) (← links)
- (Q4601822) (← links)
- Sum-Free Sets of Integers with a Forbidden Sum (Q4627481) (← links)
- The List-Decoding Size of Fourier-Sparse Boolean Functions (Q4973855) (← links)
- (Q5009505) (← links)
- (Q5009538) (← links)
- (Q5060749) (← links)
- (Q5092401) (← links)
- Task-Based Solutions to Embedded Index Coding (Q5138800) (← links)
- On Minrank and Forbidden Subgraphs (Q5205816) (← links)
- (Q5212563) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
- On the Lattice Isomorphism Problem (Q5383988) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- On the Lattice Isomorphism Problem (Q5414599) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- Symmetric complete sum-free sets in cyclic groups (Q5915549) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Local orthogonality dimension (Q6094036) (← links)
- The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications (Q6115359) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- On Minrank and the Lov\'asz Theta Function (Q6297609) (← links)
- Approximating the Orthogonality Dimension of Graphs and Hypergraphs (Q6320378) (← links)
- The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications (Q6335187) (← links)
- Nearly Orthogonal Sets over Finite Fields (Q6521561) (← links)
- Larger Nearly Orthogonal Sets over Finite Fields (Q6528709) (← links)
- A fixed-parameter algorithm for the Kneser problem (Q6560868) (← links)
- Hardness of linear index coding on perturbed instances (Q6576041) (← links)
- Minimizing the alphabet size in codes with restricted error sets (Q6576578) (← links)
- On the binary and Boolean rank of regular matrices (Q6584058) (← links)
- Improved NP-hardness of approximation for orthogonality dimension and minrank (Q6615122) (← links)
- On finding constrained independent sets in cycles (Q6638076) (← links)
