Mateusz Skomra

activity

20162026

most citedGames on Graphs: From Logic and Automata to Algorithms

10 citations · 12 across the 7 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.CC2019

Derandomization and absolute reconstruction for sums of powers of linear forms

Pascal Koiran, Mateusz Skomra

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogen…

math.AG2019

Intersection multiplicity of a sparse curve and a low-degree curve

Pascal Koiran, Mateusz Skomra

Let $F (x, y) \in C [x, y]$ be a polynomial of degree $d$ and let $G (x, y) \in C [x, y]$ be a polynomial with $t$ monomials. We want to estimate the maximal multiplicit…

math.CO2019

Convexly independent subsets of Minkowski sums of convex polygons

Mateusz Skomra, Stéphan Thomassé

We show that there exist convex $n$ -gons $P$ and $Q$ such that the largest convex polygon in the Minkowski sum $P + Q$ has size $Θ (n lo g n)$ . This matches an upper bound of Tiwary.