Ads
related to: hardest subjects in computer science- 2 Easton Oval, Columbus, OH · Directions · (614) 253-7291
Search results
Results From The WOW.Com Content Network
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.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more
Soon after it appeared, the book received positive reviews by reputed researchers in the area of theoretical computer science. In his review, Ronald V. Book recommends the book to "anyone who wishes to learn about the subject of NP-completeness", and he explicitly mentions the "extremely useful" appendix with over 300 NP-hard computational problems.
Computer science is also notorious for being a very difficult subject in schools, with high failure and dropout rates over the years it has been taught. [22] This is usually attributed to the fact that computer science as a subject is very problem-solving heavy and a lot of students can struggle with this aspect.
The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.