Byzantine gathering in polynomial time.

Sébastien Bouchard Yoann Dieudonné Anissa Lamani

Published in: Distributed Comput. (2022)

Keyphrases

fault tolerant
special case
computational complexity
approximation algorithms
computer vision
worst case
np hardness
algorithm for linear programming
databases
neural network
information systems
database systems
multi agent
learning environment
information gathering
approximation ratio