I. Haviv

activity

20112026

most citedTensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

48 citations · 68 across the 25 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

On the Subspace Choosability in Graphs

Dror Chawin, Ishay Haviv

A graph $G$ is said to be $k$ -subspace choosable over a field $F$ if for every assignment of $k$ -dimensional subspaces of some finite-dimensional vector space over $\mathb…

math.CO2021

Local Orthogonality Dimension

Inon Attias, Ishay Haviv

An orthogonal representation of a graph $G$ over a field $F$ is an assignment of a vector $u_{v} \in F^{t}$ to every vertex $v$ of $G$ , such that $\langle u_v,u_v \ra…

math.CO2021

Upper Bounds on the Boolean Rank of Kronecker Products

Ishay Haviv, Michal Parnas

The Boolean rank of a $0, 1$ -matrix $A$ , denoted $R_{B} (A)$ , is the smallest number of monochromatic combinatorial rectangles needed to cover the $1$ -entries of $A$ . In 1988,…