AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Log depth circuits for division and related problems

SIAM Journal on Computing, no. 4 (1986): 994-1003

被引用353|浏览21
EI
下载 PDF 全文
引用

摘要

We present optimal depth Boolean circuits (depth O(log 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.

代码

数据

您的评分 :
0

 

标签
评论
小科