Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Abstract. In the CB-BUSINESS project (IST-2001-33147, http://www.cbbusiness.com/), a number of administrative services from public agencies and professional chambers in different c...
Dimitris Gouscos, Maria A. Lambrou, Gregoris Mentz...
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...