  We propose an algebraic model of computation which formally relates symbolic
listings, complexity of Boolean functions, and low depth arithmetic circuit
complexity. In this model algorithms are arithmetic formula expressing symbolic
listings of YES instances of Boolean functions, and computation is executed via
partial differential operators. We consider the Chow rank of an arithmetic
formula as a measure of complexity and establish the Chow rank of multilinear
polynomials with totally non-overlapping monomial support. We also provide Chow
rank non-decreasing transformations from sets of graphs to sets of functional
graphs.
