#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2006

2017

- This year (3)
- Last 5 years (9)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marcello Mamino
- Theor. Comput. Sci.
- 2013

We study the computational complexity of a perfect-information twoplayer game proposed by Aigner and Fromme in [AF–84]. The game takes place on an undirected graph where n simultaneously moving cops attempt to capture a single robber, all moving at the same speed. The players are allowed to pick their starting positions at the first move. The question of… (More)

- Marcello Mamino, Giovanni Viglietta
- CCCG
- 2016

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are… (More)

- Manuel Bodirsky, Marcello Mamino
- The Constraint Satisfaction Problem
- 2017

We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert’s tenth problem, and many more. Our particular focus is to identify those CSPs… (More)

- Alessandro Berarducci, Marcello Mamino
- J. London Math. Society
- 2011

We consider definably compact groups in an o-minimal expansion of a real closed field. It is known that to each such group G is associated a natural exact sequence 1→ G00 → G → G/G00 → 1 where G00 is the “infinitesimal subgroup” of G and G/G00 is a compact real Lie group. We show that given a connected open subset U of G/G00 there is a canonical isomorphism… (More)

- Manuel Bodirsky, Marcello Mamino
- CSR
- 2016

A semilinear relation S ⊆ Qn is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in NP∩ co-NP, which is not… (More)

- Antongiulio Fornasiero, Marcello Mamino
- Ann. Pure Appl. Logic
- 2008

We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the theory of such structures. MSC: 06F05; 06F20

We consider groups definable in an o-minimal expansion of a real closed field. To each definable group G is associated in a canonical way a real Lie group G/G which, in the definably compact case, captures many of the algebraic and topological features of G. In particular, if G is definably compact and definably connected, the definable fundamental group of… (More)

- Marcello Mamino
- J. Symb. Log.
- 2011

- Luca Ferretti, Marcello Mamino, Ginestra Bianconi
- Physical review. E, Statistical, nonlinear, and…
- 2014

Growing network models with both heterogeneity of the nodes and topological constraints can give rise to a rich phase structure. We present a simple model based on preferential attachment with rewiring of the links. Rewiring probabilities are modulated by the negative fitness of the nodes and by the constraint for the network to be a simple graph. At low… (More)

It is known that a definably compact group G is an extension of a compact Lie group L by a divisible torsion-free normal subgroup. We show that the o-minimal higher homotopy groups of G are isomorphic to the corresponding higher homotopy groups of L. As a consequence, we obtain that all abelian definably compact groups of a given dimension are definably… (More)