On the maximum tolerable noise of k-input gates for reliable computation by formulas
IEEE Transactions on Information Theory（2003）
摘要
We determine the precise threshold of component noise below which formulas composed of odd degree components can reliably compute all Boolean functions.
更多查看译文
关键词
boolean function,maximum tolerable noise,index terms— computation by unreliable components,reliable com- puting,k-input gate,precise threshold,reliable computation,odd degree component,component noise,lower bound,boolean functions,directed graphs,information theory,reliability,indexing terms,logic circuits,computation theory
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要