The Faculty of Mathematics and Natural Sciences: Search
Now showing items 1-1 of 1
Faster Circuits for And-Or Paths and Binary Addition
(2020-07-24)
We consider the problem of constructing fast circuits both for binary addition and And-Or paths. And-Or paths are Boolean functions of the form t0 ∧ ( t1 ∨ ( t2 ∧ ( t3 ......