If I have a boolean expression made up of ANDs and XORs in algebraic normal form, are there any algorithms which can minimize the circuit further?
I'm looking to minimize AND gates specifically.
I'm building ANF from a truth table, so if there's a different way to go about getting a circuit made from XORs and ANDs starting with a truth table that has a minimal number of ANDs that'd be helpful too.
Thank you for any help you can provide!!
Edit: to be more explicit, I'm limited to using xor and and gates.