7 citations · 17 across the 12 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023
-SUM in the Sparse Regime
Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach +2
In the average-case -SUM problem, given integers chosen uniformly at random from , the objective is to find a ``solution'' set of numbers that sum to $0…
cs.CC2022
PPP-Completeness and Extremal Combinatorics
Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček +2
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on mono…