scientific article
From MaRDI portal
Publication:3305730
DOI10.4230/LIPIcs.FUN.2018.12zbMath1491.91039MaRDI QIDQ3305730
Ruben Hoeksma, Andreas Tönnis, Andrés Cristi, Kevin Schewior, Fábio Botler
Publication date: 11 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Cites Work
- Unnamed Item
- Unnamed Item
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Maximal caps in \(\mathrm{AG}(6,3)\).
- Caps and codes
- Maximal three-independent subsets of \(\{0,1,2\}^ n\)
- The card game SET.
- Extensions of generalized product caps
- The classification of the largest caps in AG(5, 3)
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- New bounds on cap sets
- Bounds on affine caps
- On Pellegrino's 20-Caps in S4, 3
- Sets, Planets, and Comets
- The Computational Complexity of the Game of Set and Its Theoretical Applications