Parameterized Complexity of Sparse Linear Complementarity Problems.

Hanna Sumita Naonori Kakimura Kazuhisa Makino

Published in: Algorithmica (2017)

Keyphrases

linear complementarity problem
parameterized complexity
sufficient conditions
variational inequalities
fixed parameter tractable
global constraints
interior point
high dimensional
semidefinite
symmetry breaking
machine learning
evolutionary algorithm
computational problems