A. Shraibman

activity

20072021

most citedLarger Corner-Free Sets from Better NOF Exactly-

N

Protocols

9 citations · 14 across the 6 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DS2019

Property testing of the Boolean and binary rank

Michal Parnas, Dana Ron, Adi Shraibman

We present algorithms for testing if a $(0, 1)$ -matrix $M$ has Boolean/binary rank at most $d$ , or is $ε$ -far from Boolean/binary rank $d$ (i.e., at least an $ε$ -fraction of the ent…

math.CO2019★ 1 cited

On maximal isolation sets in the uniform intersection matrix

Michal Parnas, Adi Shraibman

Let $A_{k, t}$ be the matrix that represents the adjacency matrix of the intersection bipartite graph of all subsets of size $t$ of ${1, 2, ..., k}$ . We give constructions of large i…