M. Di Summa

activity

20112026

most citedTowards Lower Bounds on the Depth of ReLU Neural Networks

4 citations · 6 across the 8 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.OC2026

Hardness of integer linear feasibility with cyclic support

Marco Di Summa

We prove that integer linear feasibility is strongly $N P$ -complete even when the constraint matrix has exactly two nonzero entries in every row and column, with its support forming…

math.CO2026

The red-blue-yellow matching problem

Manuel Aprile, Marco Di Summa

We consider the red-blue-yellow matching problem: given two natural numbers $k_{R}$ , $k_{B}$ and a graph $G$ whose edges are colored red, blue or yellow, the goal is to find a matching…