Single-Player and Two-Player Buttons & Scissors Games

DOI10.1007/978-3-319-48532-4_6zbMath1482.68106arXiv1607.01826OpenAlexW2462562492MaRDI QIDQ2958087

No author found.

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.01826

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probabilistic games; gambling (91A60) Algorithmic game theory and complexity (91A68)

Related Items (5)

On the Complexity of Two Dots for Narrow Boards and Few Colors. ⋮ An FPT algorithm for orthogonal buttons and scissors ⋮ Parameterized complexity of theory of mind reasoning in dynamic epistemic logic ⋮ Unnamed Item ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Packing subgraphs in a graph
• On the complexity of some two-person perfect-information games
• GO Is Polynomial-Space Hard
• Planar Formulae and Their Uses

This page was built for publication: Single-Player and Two-Player Buttons & Scissors Games