2 citations · 2 across the 2 of their papers we have counts for
2 papers
quant-ph2023
Communication complexity of entanglement assisted multi-party computation
Ruoyu Meng, Aditya Ramamoorthy
We consider a quantum and classical version multi-party function computation problem with players, where players need to communicate appropriate information to pl…
cs.LO2019★ 2 cited
Continuous Regular Functions
Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan +5
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function is -regular if there is a Büchi automaton that accepts precisely the set of base $r…