7 citations · 17 across the 21 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.CC2025
Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
Bruno Bauwens, Bruno Loff
Ball, Liu, Mazor and Pass proved that the existence of key-agreement protocols is equivalent to the hardness of a certain problem about interactive Kolmogorov complexity. We genera…
cs.CC2025
Space-bounded online Kolmogorov complexity is additive
Bruno Bauwens, Maria Marchenko
The even online Kolmogorov complexity of a string is the minimal length of a program that for all , on input outputs $…