12 citations · 19 across the 5 of their papers we have counts for
6 papers
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
Susanna F. de Rezende, David Engström, Yassine Ghannane +2
We study the average-case hardness of establishing that a graph does not have a large clique in both proof and communication complexity. We show exponential lower bounds on the len…
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…
Lower Bounds for CSP Hierarchies Through Ideal Reduction
Jonas Conneryd, Yassine Ghannane, Shuo Pang
We present a generic way to obtain level lower bounds for (promise) CSP hierarchies from degree lower bounds for algebraic proof systems. More specifically, we show that pseudo-red…
DiviML: A Module-based Heuristic for Mapping Neural Networks onto Heterogeneous Platforms
Yassine Ghannane, Mohamed S. Abdelfattah
Datacenters are increasingly becoming heterogeneous, and are starting to include specialized hardware for networking, video processing, and especially deep learning. To leverage th…
Runtime Analysis for Permutation-based Evolutionary Algorithms
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
While the theoretical analysis of evolutionary algorithms (EAs) has made significant progress for pseudo-Boolean optimization problems in the last 25 years, only sporadic theoretic…
Towards a Stronger Theory for Permutation-based Evolutionary Algorithms
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
While the theoretical analysis of evolutionary algorithms (EAs) has made significant progress for pseudo-Boolean optimization problems in the last 25 years, only sporadic theoretic…