NI is a program capable of computing truth tables for boolean functions involving hundreds of variables. Computations like these are usually considered intractable, but many are not-intractable with the algorithm used in NI (hence the acronym).
Many problems in boolean algebra require computing truth tables, but as the number of variables increases, the size of a truth table increases exponentially (For N variables, the truth table is 2^N in size). Problems involving hundreds of variables are commonly considered intractable, since we lack the storage space and processing power to handle truth tables of that size.
A truth table in NI, however, is represented in such a way that it only increases in size as the complexity of the function increases, not as the number of variables increases. Although it is still possible to come across a problem that cannot be solved in a reasonable amount of time using NI, the amount of time needed is no longer directly related to the number of variables.
These details are provided for information only. No information here is legal advice and should not be used as such.