title: Boolean Algebra Expression Simplification with large number of variables
body: <p>So, I'm aware of both Karnaugh maps and Quine McCluskey, but both of those seem to require a truth table. That seems fine for say 32 bits, but even with 32 bits, that means you have 4 billion entries in your truth table.</p>
  
  <p>What if you had (say) a thousand bits as input, and you had some giant formula for the outputs, but obviously enumerating them all that way would be infeasible.. (2^1024 and all that.)</p>
  
  <p>Is there a way of taking an expression (say an expression like</p>
  
  <p>a and b and not c and (b or c) and (not d) ... and returning a simplified expression? One that could accomodate something like hundreds or thousands of variables?</p>
  
  <p>Thanks..</p>