Given a boolean expression in variables x1,x2......xn. How quickly can we determine whether the expression ever take the value 1?

At first sight the time appears to be proportional to 2^n?

We would like to find a method whose running time depends on a power of n or else prove that this is not possible.