We extend the lower bound techniques of [17], to the unbounded-error probabilistic model. A key step in the argument is a generalization of Nepomnjaščiı̆’s theorem from the Boolean setting to the arithmetic setting. This generalization is made possible, due to the recent discovery of logspaceuniform TC0 circuits for iterated multiplication [11]. Here is an example of the sort of lower bounds tha...

We examined the relationships between role clarity, work locus of control and organization-based self-esteem, and four dimensions of commitment to supervisors (AC, NC, HiSac, LoAlt). Analyses revealed that role clarity was positively related to AC and HiSac, work locus of control was positively related to NC and negatively to LoAlt, and that organizationbased self-esteem was positively associat...

We build on Gruenhage, Natkaniec, and Piotrowski’s study of thin, very thin, and slim dense sets in products, and the related notions of (NC) and (GC) which they introduced. We find examples of separable spaces X such that X has a thin or slim dense set but no countable one. We characterize ordered spaces that satisfy (GC) and (NC), and we give an example of a separable space which satisfies (G...

In the setting known as DLOGTIME-uniformity, the fundamental complexity classes AC ⊂ ACC ⊆ TC ⊆ NC have several robust characterizations. In this paper we refine uniformity further and examine the impact of these refinements on NC and its subclasses. When applied to the logarithmic circuit depth characterization of NC, some refinements leave NC unchanged while others collapse NC to NC. Thus we ...