Log depth circuits for division and related problems
We present optimal depth Boolean circuits (depth O(\logn)) 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.
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.
We present optimal depth Boolean circuits (depth ) 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.
Society for Industrial and Applied Mathematics以上显示的是最相近的搜索结果。 查看全部搜索结果