What are the latest advances in theoretical complexity of Go?
I know some early works about the complexity of Go:
"Go is polynomial-space hard" proved that Go is PSPACE-hard.
"Ladders are PSPACE-complete" proved that ladders are PSPACE-complete.
"Go endgames are PSPACE-hard" proved that Go endgames (or yose) is PSPACE-hard.
"On the complexity of Tsume-Go" proved that the the complexity of Tsume-Go is NP-complete.
"Go Complexities" proved that Atari Go is PSPACE-complete.
Since there are several rules of Go (They are different but similar), it is a little complicated to analysis it. We only know that the lower bound of the complexity of Go is PSPACE-hard and the upper bound of it is EXPSPACE.