On The Complexity of Counter Reachability Games*
Work
Year: 2016
Type: article
Abstract: Counter reachability games are played by two players on a graph with labelled edges. Each move consists of picking an edge from the current location and adding its label to a counter vector. The objec... more
Source: Fundamenta Informaticae
Author Julien Reichert
Institution École Normale Supérieure Paris-Saclay
Cites: 8
Cited by: 8
Related to: 10
FWCI: 1.203
Citation percentile (by year/subfield): 79.3
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: green