Interesting Esoterica

The hardness of the Lemmings game, or Oh no, more NP-completeness proofs

Article by Cormode, Graham
  • Published in 2004
  • Added on

Links

Other information

booktitle
Proceedings of the 3rd International Conference on FUN with Algorithms
pages
65--76

BibTeX entry

@article{Cormode2004,
	title = {The hardness of the Lemmings game, or Oh no, more NP-completeness proofs},
	author = {Cormode, Graham},
	url = {https://pdfs.semanticscholar.org/9413/3f598974f93b089ca7d2875d59d0dab1e1eb.pdf},
	urldate = {2012-01-27},
	year = 2004,
	abstract = {},
	comment = {},
	booktitle = {Proceedings of the 3rd International Conference on FUN with Algorithms},
	pages = {65--76},
	collections = {Animals,Attention-grabbing titles,Basically computer science,Games to play with friends,Computational complexity of games}
}