I want to simplify a very large boolean function of the form :
f(a1,a2,....,an)= (a1+a2+a5).(a2+a7+a11+a23+a34)......(a1+a3+an).
'.' means OR
'+' means AND
there may be 100 such terms ('.' with each other ) value of n may go upto 30.
Is there any feasible algorithm to simplify this?
NOTE: this is not a lab assignment, a small part of my project on rule generation by rough set where f is dissimilarity function.