benameur2024complexity (353B)
1 # Benameur2024complexity 2 3 about [hunters_and_rabbit_directed] 4 5 shows that recognizing graphs where the rabbit wins is [np_hard] even against just one hunter 6 - and [pspace] upper bound 7 - [open_question] of whether it is [pspace_hard] 8 9 connections to [matrix_mortality] 10 11 Up: [academic_paper] on [hunters_and_rabbit_directed] 12 13 See also: [benameur2024cops]