On tests of uniform tree circuits

Abstract

This paper explores the structure of test complexity classes of uniform tree circuits. We prove that the test complexity of a balanced uniform tree circuit is either 0(1) or Ω(lg n), the test complexity of balanced uniform tree circuits based on commutative functions can be divided into constant, logarithmic and polynomial classes, and balanced uniform tree circuits based on monotonie functions are all Θ(nr) (r ε (0,1]) testable.