The P vs NP problem

Julie Thornton, Computer Science, Kansas State University

CW 122

Abstract: The P vs NP problem is an important unsolved problem in theoretical computer science and mathematics. It asks whether the set of problems that can be solved in polynomial time is equal to the set of problems that can be verified in polynomial time. P vs NP is one of the Millenium Problems, and its solution can potentially impact the security of many major cryptographic systems.

Julie Thornton has an MS in computer science (Kansas State University, 2005) and a BS in both mathematics and computer science (Kansas State University, 2003). She has worked as an instructor and academic advisor in the computer science department at K-State since 2005.