|
%I #10 May 05 2021 10:38:44
%S 1,1,4,7,12
%N Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions.
%D D. E. Knuth, The Art of Computer Programming, Volume 4A, Section 7.1.2.
%Y Cf. A056287.
%K nonn,nice,hard,more
%O 1,3
%A _Russ Cox_, Dec 30 2010
|
