Login / Signup
How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard.
Vincent D. Blondel
Alex Olshevsky
Published in:
SIAM J. Control. Optim. (2014)
Keyphrases
</>
sufficient conditions
np hard
optimal solution
efficiently computable
exponential stability
asymptotic stability
uniform convergence
linear programming
multi class
special case
lower bound
reinforcement learning
worst case
first order logic
input output
linear complementarity problem
equilibrium point