\textsc{Superset}: A (super)natural variant of the card game \textsc{Set}

DOI10.4230/LIPICS.FUN.2018.12MaRDI QIDQ3305730zbMATH OpenFDO

Authors Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis, F. Botler

Publication date 11 August 2020

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2018.12

zbMATH Keywords

affine geometrycap setcard gamecomputational complexitySetSuperset

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• The computational complexity of the game of Set and its theoretical applications
• Counting SET-free sets
• Game, Set, Math
• A variation on the game SET
• The card game SET.

Cites work

• Bounds on affine caps
• Caps and codes
• Extensions of generalized product caps
• scientific article; zbMATH DE number 3354142 (Why is no real title available?)
• Introduction to algorithms.
• Maximal caps in \(\mathrm{AG}(6,3)\).
• Maximal three-independent subsets of \(\{0,1,2\}^ n\)
• New bounds on cap sets
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• On Pellegrino's 20-Caps in S4, 3
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• Sets, planets, and comets
• The card game SET.
• The classification of the largest caps in AG(5, 3)
• The computational complexity of the game of Set and its theoretical applications

Cited in

(2)

• The computational complexity of the game of Set and its theoretical applications
• Affine relations in the card game SET and related games

This page was built for publication: \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305730)