Matches in DBpedia 2014 for { <http://dbpedia.org/resource/NP-complete> ?p ?o. }
Showing items 1 to 64 of
64
with 100 items per page.
- NP-complete abstract "In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems and also in the set of NP-hard problems. The abbreviation NP refers to "nondeterministic polynomial time."Although any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution in the first place; indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known. That is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. This means that the time required to solve even moderately sized versions of many of these problems can easily reach into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly, called the P versus NP problem, is one of the principal unsolved problems in computer science today.While a method for computing the solutions to NP-complete problems using a reasonable amount of time remains undiscovered, computer scientists and programmers still frequently encounter NP-complete problems. NP-complete problems are often addressed by using heuristic methods and approximation algorithms.".
- NP-complete thumbnail P_np_np-complete_np-hard.svg?width=300.
- NP-complete wikiPageExternalLink 0210020.
- NP-complete wikiPageExternalLink 0502072.
- NP-complete wikiPageExternalLink ordmsw.htm.
- NP-complete wikiPageExternalLink hmsunCh08.ppt.
- NP-complete wikiPageExternalLink pnp-cacm.pdf.
- NP-complete wikiPageExternalLink lect8.pdf.
- NP-complete wikiPageExternalLink annotated_np.html.
- NP-complete wikiPageExternalLink NPC-3.ppt.
- NP-complete wikiPageExternalLink hard.html.
- NP-complete wikiPageExternalLink lan-cx-np,intro.html.
- NP-complete wikiPageExternalLink compendium.html.
- NP-complete wikiPageID "23385892".
- NP-complete wikiPageRevisionID "596284955".
- NP-complete bot "H3llBot".
- NP-complete date "October 2010".
- NP-complete hasPhotoCollection NP-complete.
- NP-complete subject Category:1971_in_computer_science.
- NP-complete subject Category:Articles_with_inconsistent_citation_formats.
- NP-complete subject Category:Complexity_classes.
- NP-complete subject Category:Mathematical_optimization.
- NP-complete subject Category:NP-complete_problems.
- NP-complete type Abstraction100002137.
- NP-complete type Attribute100024264.
- NP-complete type Class107997703.
- NP-complete type Collection107951464.
- NP-complete type ComplexityClasses.
- NP-complete type Condition113920835.
- NP-complete type Difficulty114408086.
- NP-complete type Group100031264.
- NP-complete type NP-completeProblems.
- NP-complete type Problem114410605.
- NP-complete type State100024720.
- NP-complete comment "In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems and also in the set of NP-hard problems.".
- NP-complete label "NP-Completo".
- NP-complete label "NP-Vollständigkeit".
- NP-complete label "NP-complete".
- NP-complete label "NP-completo".
- NP-complete label "NP-completo".
- NP-complete label "NP-volledig".
- NP-complete label "NP-полная задача".
- NP-complete label "NP完全".
- NP-complete label "NP完全問題".
- NP-complete label "Problem NP-zupełny".
- NP-complete label "Problème NP-complet".
- NP-complete label "مسألة كثيرة حدود غير قطعية كاملة".
- NP-complete sameAs NP-úplnost.
- NP-complete sameAs NP-Vollständigkeit.
- NP-complete sameAs NP-completo.
- NP-complete sameAs Problème_NP-complet.
- NP-complete sameAs NP-Completo.
- NP-complete sameAs NP完全問題.
- NP-complete sameAs NP-완전.
- NP-complete sameAs NP-volledig.
- NP-complete sameAs Problem_NP-zupełny.
- NP-complete sameAs NP-completo.
- NP-complete sameAs m.09tkl.
- NP-complete sameAs Q215206.
- NP-complete sameAs Q215206.
- NP-complete sameAs NP-complete.
- NP-complete wasDerivedFrom NP-complete?oldid=596284955.
- NP-complete depiction P_np_np-complete_np-hard.svg.
- NP-complete isPrimaryTopicOf NP-complete.