We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Background: The aim of this study was to provide a framework for the analysis of visceral obesity and its determinants in women, where complex inter-relationships are observed amo...
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...