On Consensus under Polynomial Protocols
classification
💻 cs.SC
keywords
consensusprotocolsunderalgebraicanalyzeclasscomputationalconditions
read the original abstract
In this paper we explore the possibility of using computational algebraic methods to analyze a class of consensus protocols. We state some necessary conditions for convergence under consensus protocols that are polynomials.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.