On the complexity of computing a random Boolean function over the reals

Pavel Hrubes. On the complexity of computing a random Boolean function over the reals. Electronic Colloquium on Computational Complexity (ECCC), 26:36, 2019. [doi]

Abstract

Abstract is missing.