Non-cancellative Boolean circuits: A gen
β
Rimli Sengupta; H. Venkateswaran
π
Article
π
2000
π
Elsevier Science
π
English
β 128 KB
Cancellations are known to be helpful in e cient algebraic computation of polynomials over ΓΏelds. We deΓΏne a notion of cancellation in Boolean circuits and deΓΏne Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization of mo