no code implementations • 28 Jan 2021 • Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Oftermatt, Guillermo A. Pérez
Our three main results are as follows: (1) We prove that the reachability problem for COCA with global upper and lower bound tests is in NC2; (2) that, in general, the problem is decidable in polynomial time; and (3) that it is decidable in the polynomial hierarchy for COCA with parametric counter updates and bound tests.
Formal Languages and Automata Theory Logic in Computer Science
no code implementations • 6 Apr 2020 • Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
In this paper we cast neural networks defined on graphs as message-passing neural networks (MPNNs) in order to study the distinguishing power of different classes of such models.
