登入選單

返回Google圖書搜尋

Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly

University of California, Berkeley. Computer Science DivisionPeter Gemmell

出版	University of California, Berkeley, Computer Science Division, 1993
URL	http://books.google.com.hk/books?id=EvatHAAACAAJ&hl=&source=gbs_api

註釋

We consider the problem of adding two $n$-bit numbers which are chosen independently and uniformly at random where the adder is circuit of AND, OR, and NOT gates of fanin two.