Los puntos clave no están disponibles para este artículo en este momento.
We present optimal depth Boolean circuits (depth O (n) ) for integer division, powering, and multiple products. We also show that these three problems are of equivalent uniform depth and space complexity. In addition, we describe an algorithm for testing divisibility that is optimal for both depth and space.
Beame et al. (Sat,) studied this question.