Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Cook posed the question of finding a natural problem that is complete for AC1. It is shown here that a certain two-person game of perfect information is such a problem. Variants of this game are shown to be complete for P and for LOGCFL. © 1990.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
Nimrod Megiddo
Journal of Symbolic Computation
Imran Nasim, Melanie Weber
SCML 2024