Reachability in Graphs with Polynomially Many Surface Non-separating Cycles is in UL.

Neelabjo Shubhashis Choudhury, Chetan Gupta, Raghunath Tewari

Browse the full IWOCA paper archive.