Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

In spite of several claims stating that some models are more interpretable than others--eg,"
linear models are more interpretable than deep neural networks"--we still lack a principled …

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-
DOMINATING SET, essentially no better algorithm is presently known than the one which …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

This paper presents an O (1.2738 k+ kn)-time polynomial-space algorithm for Vertex Cover
improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by Chen, Kanj …