Login / Signup

Efficient method to compute minimum decision chains of Boolean functions.

Mayler G. A. MartinsVinicius CallegaroRenato P. RibasAndré Inácio Reis
Published in: ACM Great Lakes Symposium on VLSI (2011)
Keyphrases
  • boolean functions
  • computational complexity
  • prime implicants
  • decision problems
  • binary decision diagrams