Ohad Klein

activity

20172022

most citedQuantum speedups need structure

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Slicing all Edges of an $n$ -cube Requires $n^{2/3}$ Hyperplanes

Ohad Klein

Consider the $n$ -cube graph with vertices ${- 1, 1}^{n}$ and edges connecting vertices with hamming distance $1$ . How many hyperplanes in $R^{n}$ are needed in order to dissec…

cs.DS2022

Locality-Preserving Hashing for Shifts with Connections to Cryptography

Elette Boyle, Itai Dinur, Niv Gilboa +3

Can we sense our location in an unfamiliar environment by taking a sublinear-size sample of our surroundings? Can we efficiently encrypt a message that only someone physically clos…

Slicing all Edges of an n-cube Requires n2/3 Hyperplanes

Locality-Preserving Hashing for Shifts with Connections to Cryptography

Slicing all Edges of an $n$ -cube Requires $n^{2/3}$ Hyperplanes