Optimization of fixed-polarity Reed-Muller circuits using dual-polarity property

Graph-Based Algorithms for Boolean Function Manipulation

Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text

Computing, Computer Science, Algorithms +16

Easily Testable Realizations ror Logic Functions

S.M. Reddy · IEEE Transactions on Computers · 1972 · 278 citations

Engineering, Computer Engineering, Computer Science +13

On a Theory of Boolean Functions

Sheldon B. Akers · Journal of the Society for Industrial and Applied Mathematics · 1959 · 194 citations

Natural Sciences, Computer Science, Mathematics +12

On the complexity of mod-2l sum PLA's

T. Sasao, Philipp W. Besslich · IEEE Transactions on Computers · 1990 · 180 citations

Computing, Computer Engineering, Computer Science +16

Easily testable realizations for logic functions

S.M. Reddy · Computer-Aided Design · 1973 · 96 citations

Engineering, Computer Engineering, Computer Science +14