NP complexity class/Related Articles: Difference between revisions
Jump to navigation
Jump to search
Pat Palmer (talk | contribs) mNo edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
{{r|Stephen Cook}} | {{r|Stephen Cook}} | ||
{{r|Richard Karp}} | {{r|Richard Karp}} | ||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Chinese Space Plane}} | |||
{{r|Huey Long}} | |||
{{r|Spanish missions in California}} | |||
{{r|Ajax (web technology)}} | |||
Latest revision as of 06:01, 23 September 2024
- See also changes related to NP complexity class, or pages that link to NP complexity class or to this page or whose text contains "NP complexity class".
Parent topics
- Computational complexity theory [r]: Add brief definition or description
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
Subtopics
- P-versus-NP problem [r]: A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time. [e]
- Millennium Prize Problems [r]: Add brief definition or description
- Stephen Cook [r]: Add brief definition or description
- Richard Karp [r]: Add brief definition or description
- Chinese Space Plane [r]: A reusable Spaceplane being developed as part of Chinese Space Program [e]
- Huey Long [r]: Add brief definition or description
- Spanish missions in California [r]: A series of twenty-one religious outposts and associated support facilities established by Spaniards of the Franciscan Order between 1769 and 1823, in order to spread the Catholic faith among the local Native American populations. [e]
- Ajax (web technology) [r]: JavaScript programming technique to communicate with the server without reloading the webpage. [e]