1. The document discusses research into proving lower bounds on the complexity of problems in the NP class in order to help answer the P versus NP question. 2. It describes current techniques like diagonalization and combinatorial circuits that are used to prove lower bounds and the limitations of these methods. 3. The researcher aims to conduct an experiment applying diagonalization and circuit techniques simultaneously to problems like the Traveling Salesman Problem to develop a more efficient new technique for determining lower bounds.