I do recognise the fact about that truth tables beyond a certain number of bits would be a problem. But I guess mine gives good results upto 10-12 bits with decent time(tested). But I don't think anyone needing to solving more complex functions than that would use sympy/python. In any case, I have submitted a pull request for the same. In future, if a better algorithm is implemented, mine can be substituted. But I will look at the algo you mentioned. (Just tested for 15 bits, but did take like half a second or so)
-- You received this message because you are subscribed to the Google Groups "sympy" group. To view this discussion on the web visit https://groups.google.com/d/msg/sympy/-/7Hoe9lgol-MJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
