Counting classes and the fine structure between and

The class  of problems solvable by bounded fan-in circuit families of logarithmic depth is known to be contained in logarithmic space , but not much about the converse is known. In this paper we examine the structure of classes in between  and  based on counting functions or, equivalently, based on arithmetic circuits. The classes  and , defined by a test for positivity and a test for zero, respectively, of arithmetic circuit families of logarithmic depth, sit in this complexity interval. We study the landscape of Boolean hierarchies, constant-depth oracle hierarchies, and logarithmic-depth oracle hierarchies over  and . We provide complete problems, obtain the upper bound  for all these hierarchies, and prove partial hierarchy collapses. In particular, the constant-depth oracle hierarchy over  collapses to its first level , and the constant-depth oracle hierarchy over  collapses to its second level.