Old Web
English
Sign In
Acemap
>
Paper
>
Stubborn Set Reduction for Two-Player Reachability Games. (arXiv:1912.09875v2 [cs.LO] UPDATED)
Stubborn Set Reduction for Two-Player Reachability Games. (arXiv:1912.09875v2 [cs.LO] UPDATED)
2020
Frederik Meyer Bønneland
Peter Gjøl Jensen
Kim Guldstrand Larsen
Marco Muñiz
Jiri Srba
Keywords:
Reachability
Discrete mathematics
Set (abstract data type)
Reduction (complexity)
Computer science
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]