popular approach
used path
Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a popular approach to separating complexity classes.
Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a used path to separating complexity classes.