Top Qs
Timeline
Chat
Perspective

List of unsolved problems in computer science

List of unsolved computational problems From Wikipedia, the free encyclopedia

Remove ads

This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known or when experts in the field disagree about proposed solutions.

Computational complexity

Remove ads

Polynomial versus nondeterministic-polynomial time for specific algorithmic problems

Summarize
Perspective

The graph isomorphism problem involves determining whether two finite graphs are isomorphic, meaning there is a one-to-one correspondence between their vertices and edges that preserves adjacency. While the problem is known to be in NP, it is not known whether it is NP-complete or solvable in polynomial time. This uncertainty places it in a unique complexity class, making it a significant open problem in computer science.[2]

Remove ads

Other algorithmic problems

Programming language theory

Other problems

Remove ads

References

Loading content...
Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads