The set coincidence game: Complexity, attainability, and symmetric strategies
type: Item
instance of: scholarly article
title: The set coincidence game: Complexity, attainability, and symmetric strategies
zbMATH Open document ID: 0689.68068
DOI: 10.1016/0022-0000(89)90028-7
author: Jianyong Qiao
author: Sumit K. Garg
published in: Journal of Computer and System Sciences
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 4130020
zbMATH Keywords: complexity theory
zbMATH Keywords: Set Coincidence Game
zbMATH Keywords: attainability
MaRDI profile type: Publication
full work available at URL: 0022-0000(89)90028-7
OpenAlex ID: W2012185194
cites work: Variations on a game
cites work: Q3941433
cites work: Q4114975
cites work: Q3344237
cites work: Q3775357
cites work: Q4099541
cites work: Bottleneck extrema
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: Q4198056
cites work: Q3679226
cites work: Q3310633
cites work: Extensive Games
cites work: On Ringeisen's isolation game
cites work: The isolation game for regular graphs
cites work: On the complexity of some two-person perfect-information games
cites work: On the complexity of chess
description: scientific article; zbMATH DE number 4130020