The Million Dollar problem: Is P=NP?

Is every NP problem (i.e., a problem for which a solution exists that can be checked in polynomial runtime) also a P problem (i.e., a problem for which a solution with a polynomial runtime exists)? – This question is one of the Millennium problems. Briefly stated: “Does P=NP?” It is one of the most important and central questions in computer science and mathematics, yet unsolved, today.

• How can we tell in advance what can be drawn as a continuous line drawing (CLD) and what can’t?
• Is there a method that can determine for any given graph whether a continuous line drawing (CLD) exists which goes through each node exactly once?
• Can any semiprime number be decomposed into its two prime factors in a polynomial time?

Graph Theory MSC2020 97K30 

• A graph is a collection of nodes, some of which are connected by edges (not necessarily straight lines).

Number theory MSC2020 97F60.

• Prime numbers.Semiprime numbers.

Informal geometry (educational aspects) MSC2020 97G20

• Continuous line drawing.

Theoretical Computer Science MSC2020 97P20.

• P Class. NP class.