Segev Shlomov, Avi Yaeli
CHI 2024
Paper
Bounding Fan-out in Logical Networks
Abstract
Algorithms are presented which modify logical networks of bounded fan-in to obtain functionally equivalent networks of bounded fan-m and fan-out, so that both size and depth are not increased by more than constant factors. © 1984, ACM. All rights reserved.
Related
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Hannah Kim, Celia Cintas, et al.
IJCAI 2023