An algorithmic analysis of the Honey-Bee game
type: Item
instance of: scholarly article
title: An algorithmic analysis of the Honey-Bee game
zbMATH Open document ID: 1247.68097
author: Rudolf Fleischer
author: Gerhard J. Woeginger
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 6093014
zbMATH Keywords: combinatorial game
zbMATH Keywords: computational complexity
zbMATH Keywords: graph problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.05.032
OpenAlex ID: W2064727996
cites work: Q4407717
cites work: TETRIS IS HARD, EVEN TO APPROXIMATE
cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
cites work: Computing a perfect strategy for nxn chess requires time exponential in n
cites work: Q4198056
cites work: Comparability graphs and intersection graphs
cites work: The Othello game on an \(n\times n\) board is PSPACE-complete
cites work: GO Is Polynomial-Space Hard
cites work: Mathematical Foundations of Computer Science 2003
cites work: More on the complexity of common superstring and supersequence problems
cites work: Gobang is PSPACE-complete
cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete)
cites work: N by N Checkers is Exptime Complete
cites work: Q4407697
DOI: 10.1016/J.TCS.2012.05.032
description: scientific article; zbMATH DE number 6093014