Truth-table upper bound for circuit size
= Truth-table upper bound for circuit size
{title2=$L\in\mathrm{SIZE}(O(n2^n))$}
OR together one minterm for each accepted length-$n$ input. Each minterm is an AND of the appropriate <Boolean literals>. There are at most $2^n$ minterms, and their negated input wires can be shared, giving $O(n2^n)$ bounded-fan-in gates. This is a nonuniform existence statement, not an algorithm for determining an <undecidable> truth table.