Showing 2026Show all
2 papers · 1 filter
cs.GT2026
On Cutting Cakes and Crossing Curves
Alexandros Hollender, Gilbert Maystre, Kilian Risse
We consider the classic envy-free cake-cutting problem where the goal is to cut and allocate a divisible resource among a set of agents in a way that avoids any envy between them.…
cs.CC2026
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
Susanna F. de Rezende, David Engström, Yassine Ghannane +1
We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \l…