DBpedia – Linked Data Fragments

Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/NP-completeness> ?p ?o }

• NP-completeness abstract "In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC. 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. 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-completeness thumbnail P_np_np-complete_np-hard.svg?width=300.
• NP-completeness wikiPageExternalLink hmsunCh08.ppt.
• NP-completeness wikiPageExternalLink lect8.pdf.
• NP-completeness wikiPageExternalLink annotated_np.html.
• NP-completeness wikiPageExternalLink NPC-3.ppt.
• NP-completeness wikiPageExternalLink lan-cx-np,intro.html.
• NP-completeness wikiPageExternalLink compendium.html.
• NP-completeness wikiPageExternalLink 0210020.
• NP-completeness wikiPageExternalLink 0502072.
• NP-completeness wikiPageExternalLink ordmsw.htm.
• NP-completeness wikiPageExternalLink pnp-cacm.pdf.
• NP-completeness wikiPageExternalLink hard.html.
• NP-completeness wikiPageID "23385892".
• NP-completeness wikiPageLength "27125".
• NP-completeness wikiPageOutDegree "140".
• NP-completeness wikiPageRevisionID "681771025".
• NP-completeness wikiPageWikiLink 2-satisfiability.
• NP-completeness wikiPageWikiLink 3-satisfiability.
• NP-completeness wikiPageWikiLink AC0.
• NP-completeness wikiPageWikiLink ACM_SIGACT.
• NP-completeness wikiPageWikiLink Abstract_machine.
• NP-completeness wikiPageWikiLink Advanced_Encryption_Standard.
• NP-completeness wikiPageWikiLink Alfred_Aho.
• NP-completeness wikiPageWikiLink Algorithm.
• NP-completeness wikiPageWikiLink Almost_complete.
• NP-completeness wikiPageWikiLink Approximation_algorithm.
• NP-completeness wikiPageWikiLink Bipartite_graph.
• NP-completeness wikiPageWikiLink Boolean_satisfiability_problem.
• NP-completeness wikiPageWikiLink Category:1971_in_computer_science.
• NP-completeness wikiPageWikiLink Category:Articles_with_inconsistent_citation_formats.
• NP-completeness wikiPageWikiLink Category:Complexity_classes.
• NP-completeness wikiPageWikiLink Category:Mathematical_optimization.
• NP-completeness wikiPageWikiLink Category:NP-complete_problems.
• NP-completeness wikiPageWikiLink Charles_E._Leiserson.
• NP-completeness wikiPageWikiLink Clay_Mathematics_Institute.
• NP-completeness wikiPageWikiLink Clifford_Stein.
• NP-completeness wikiPageWikiLink Clique_problem.
• NP-completeness wikiPageWikiLink Co-NP.
• NP-completeness wikiPageWikiLink Co-NP-complete.
• NP-completeness wikiPageWikiLink Commun._ACM.
• NP-completeness wikiPageWikiLink Communications_of_the_ACM.
• NP-completeness wikiPageWikiLink Complement_(complexity).
• NP-completeness wikiPageWikiLink Computational_complexity_theory.
• NP-completeness wikiPageWikiLink Computer_programmer.
• NP-completeness wikiPageWikiLink Computer_science.
• NP-completeness wikiPageWikiLink Computer_scientist.
• NP-completeness wikiPageWikiLink Computers_and_Intractability.
• NP-completeness wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
• NP-completeness wikiPageWikiLink Concatenation.
• NP-completeness wikiPageWikiLink Cooks_theorem.
• NP-completeness wikiPageWikiLink Cook–Levin_theorem.
• NP-completeness wikiPageWikiLink Cycle_graph.
• NP-completeness wikiPageWikiLink David_S._Johnson.
• NP-completeness wikiPageWikiLink Decision_problem.
• NP-completeness wikiPageWikiLink Determinism.
• NP-completeness wikiPageWikiLink Deterministic.
• NP-completeness wikiPageWikiLink Dominating_set.
• NP-completeness wikiPageWikiLink Dominating_set_problem.
• NP-completeness wikiPageWikiLink Donald_Knuth.
• NP-completeness wikiPageWikiLink Gadget_(computer_science).
• NP-completeness wikiPageWikiLink Galley_proof.
• NP-completeness wikiPageWikiLink Galley_proofs.
• NP-completeness wikiPageWikiLink Genetic_algorithm.
• NP-completeness wikiPageWikiLink Gerhard_J._Woeginger.
• NP-completeness wikiPageWikiLink Graph-coloring_global_register_allocation.
• NP-completeness wikiPageWikiLink Graph_coloring.
• NP-completeness wikiPageWikiLink Graph_coloring_problem.
• NP-completeness wikiPageWikiLink Graph_isomorphism.
• NP-completeness wikiPageWikiLink Graph_isomorphism_problem.
• NP-completeness wikiPageWikiLink Graph_theory.
• NP-completeness wikiPageWikiLink Greedy_coloring.
• NP-completeness wikiPageWikiLink Hamiltonian_path_problem.
• NP-completeness wikiPageWikiLink Heuristic_(computer_science).
• NP-completeness wikiPageWikiLink Independent_set_(graph_theory).
• NP-completeness wikiPageWikiLink Independent_set_problem.
• NP-completeness wikiPageWikiLink Intersection.
• NP-completeness wikiPageWikiLink Introduction_to_Algorithms.
• NP-completeness wikiPageWikiLink Isomorphic.
• NP-completeness wikiPageWikiLink Isomorphism.
• NP-completeness wikiPageWikiLink Jeffrey_Ullman.
• NP-completeness wikiPageWikiLink John_Hopcroft.
• NP-completeness wikiPageWikiLink Karps_21_NP-complete_problems.
• NP-completeness wikiPageWikiLink Kenneth_Steiglitz.
• NP-completeness wikiPageWikiLink Kleene_star.
• NP-completeness wikiPageWikiLink Knapsack_problem.
• NP-completeness wikiPageWikiLink L_(complexity).
• NP-completeness wikiPageWikiLink Labours_of_Hercules.
• NP-completeness wikiPageWikiLink Ladners_theorem.
• NP-completeness wikiPageWikiLink Lance_Fortnow.
• NP-completeness wikiPageWikiLink List_of_NP-complete_problems.
• NP-completeness wikiPageWikiLink List_of_open_problems_in_computer_science.
• NP-completeness wikiPageWikiLink List_of_unsolved_problems_in_computer_science.
• NP-completeness wikiPageWikiLink List_of_unsolved_problems_in_mathematics.
• NP-completeness wikiPageWikiLink Log-space_reduction.
• NP-completeness wikiPageWikiLink Logarithmic-space_many-one_reduction.
• NP-completeness wikiPageWikiLink Logarithmic_space.
• NP-completeness wikiPageWikiLink Many-one_reduction.
• NP-completeness wikiPageWikiLink Marek_Karpinski.
• NP-completeness wikiPageWikiLink Metaheuristic.

• next