Adaptive logspace and depth-bounded reducibilities. Connections between the complexity of unique satisfiability and the threshold behavior of randomized reductions. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. Mauricio Karchmer , Ran Raz , and Avi Wigderson . Superlinear lower bounds for bounded-width branching programs.
Geometric arguments yield better bounds for threshold circuits and distributed computing.
Jeff Edmonds . Lower bounds with smaller domain size on concurrent write parallel machines. 30 June-3 July 1991. Capturing complexity classes by fragments of second order logic. Approximation properties of NP minimization classes.