Let's say that I have a digital circuit made up of XOR and AND gates.
Is there any way to describe the complexity of that circuit?
I could just use the total number of gates, but gates being in parallel are not quite the same thing as them being in series when things like latency are concerned.
Also, if at all relevant to an answer for the above, in my particular case, AND is much more costly of an operation than XOR (AND is multiplication where XOR is addition), so should be waited more heavily ideally.
If that last constraint doesn't fit into an established complexity metric for circuits, that is totally fine, and I'm still interested in an answer without that information taken into account.