On the complexity of some two-person perfect-information games
type: Item
instance of: scholarly article
title: On the complexity of some two-person perfect-information games
zbMATH Open document ID: 0383.90112
DOI: 10.1016/0022-0000(78)90045-4
author: Thomas J. Schaefer
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 3596616
Wikidata QID: Q56850877
MaRDI profile type: Publication
full work available at URL: 0022-0000(78)90045-4
OpenAlex ID: W2042714866
cites work: Q5774938
cites work: Q4138187
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: Some simplified NP-complete graph problems
cites work: Q3239652
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q4142699
cites work: Q4157951
cites work: Q3888985
cites work: Q4131648
cites work: Q4099541
description: scientific article; zbMATH DE number 3596616