Can emptiness of reversal-bounded counter languages be decided in time polynomial to the number of counters? Posted by jmite, at cstheory.stackexchange.com, 04 Jul 2013 I was reading this paper, about the complexity of decision problems…