STOC2024
Memory Checking Requires Logarithmic Overhead
Elette Boyle, Ilan Komargodski, Neekon Vafa
2 citations
Abstract
We study the complexity of memory checkers with computational security and prove the first general tight lower bound.
STOC2024
Elette Boyle, Ilan Komargodski, Neekon Vafa
2 citations
We study the complexity of memory checkers with computational security and prove the first general tight lower bound.