Showing 2021Show all
2 papers · 1 filter
math.CO2021
On the Subspace Choosability in Graphs
Dror Chawin, Ishay Haviv
A graph is said to be -subspace choosable over a field if for every assignment of -dimensional subspaces of some finite-dimensional vector space over $\mathb…
cs.CC2021
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Dror Chawin, Iftach Haitner, Noam Mazor
We study time/memory tradeoffs of function inversion: an algorithm, i.e., an inverter, equipped with an s-bit advice on a randomly chosen function and using or…