Interesting Esoterica

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

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

@inproceedings{Cormode2004,
	author = {Cormode, Graham},
	booktitle = {Proceedings of the 3rd International Conference on FUN with Algorithms},
	pages = {65--76},
	title = {The hardness of the Lemmings game, or Oh no, more NP-completeness proofs},
	url = {http://scholar.google.com/scholar?hl=en{\&}btnG=Search{\&}q=intitle:The+Hardness+of+the+Lemmings+Game+,+or+Oh+no+,+more+NP-Completeness+Proofs{\#}0},
	year = 2004,
	urldate = {2012-01-27},
	collections = {Attention-grabbing titles,Basically computer science,Games to play with friends,Animals}
}