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 2022Show all

4 papers · 1 filter

cs.DS2022

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems

Ishay Haviv

The Kneser graph $K (n, k)$ is defined for integers $n$ and $k$ with $n \geq 2 k$ as the graph whose vertices are all the $k$ -subsets of $[n] = {1, 2, \dots, n}$ where two such sets are…

math.CO2022

The Binary Rank of Circulant Block Matrices

Ishay Haviv, Michal Parnas

The binary rank of a $0, 1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldo…

cs.DS2022

A Fixed-Parameter Algorithm for the Kneser Problem

Ishay Haviv

The Kneser graph $K (n, k)$ is defined for integers $n$ and $k$ with $n \geq 2 k$ as the graph whose vertices are all the $k$ -subsets of ${1, 2, \dots, n}$ where two such sets are adj…

math.CO2022

On the Binary and Boolean Rank of Regular Matrices

Ishay Haviv, Michal Parnas

A $0, 1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$ , there exists a square regular $0,1…