|
Volumn 31, Issue 1, 2002, Pages 39-45
|
On computational complexity of membership test in flow games and linear production games
a b c b |
Author keywords
Flow game; Linear production game; NP complete
|
Indexed keywords
|
EID: 0036745726
PISSN: 00207276
EISSN: None
Source Type: Journal
DOI: 10.1007/s001820200106 Document Type: Article |
Times cited : (29)
|
References (13)
|