Uniform characterizations of complexity classes

We use derandomization to show that sequences of positive pspace-dimension – in fact, even positive Δ$^{\rm p}_{\rm k}$-dimension for suitable k – have, for many purposes, the full power of random oracles. For example, we show that, if S is any binary ...

We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between $${\mathsf{P}}$$P and $${\mathsf{PSPACE}}$$PSPACE, short of proving lower bounds ...