38 citations · 45 across the 3 of their papers we have counts for
4 papers
Wordle is NP-hard
Daniel Lokshtanov, Bernardo Subercaseaux
Wordle is a single-player word-guessing game where the goal is to discover a secret word that has been chosen from a dictionary . In order to discover , the player can ma…
Model Interpretability through the Lens of Computational Complexity
Pablo Barceló, Mikaël Monet, Jorge Pérez +1
In spite of several claims stating that some models are more interpretable than others -- e.g., "linear models are more interpretable than deep neural networks" -- we still lack a…
The Computational Complexity of Evil Hangman
Jérémy Barbay, Bernardo Subercaseaux
The game of Hangman is a classical asymmetric two player game in which one player, the setter, chooses a secret word from a language, that the other player, the guesser, tries to d…
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra
Pablo Barceló, Nelson Higuera, Jorge Pérez +1
We study the expressive power of the LARA language -- a recently proposed unified model for expressing relational and linear algebra operations -- both in terms of traditional data…