Abdallah Saffidine

collaborators

2 papers

cs.CC2026

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity

Simon Mackenzie, Abdallah Saffidine

In communication complexity the input of a function $f : X \times Y \to Z$ is distributed between two players Alice and Bob. If Alice knows only $x \in X$ and Bob only $y \in Y$ ,…

math.CO2024

Constructions, bounds, and algorithms for peaceable queens

Katie Clinch, Matthew Drescher, Tony Huynh +1

The peaceable queens problem asks to determine the maximum number $a (n)$ such that there is a placement of $a (n)$ white queens and $a (n)$ black queens on an $n \times n$ chessboard…