OnlineWoerterBuecher.de
Internes

Lexikon


NP-complete


exity> (NPC, Nondeterministic Polynomial time complete) A set or property of computational ef="module.php?name=Lexikon&file=search&eid=1&query=decision problem">decision problems which is a subset of ef="module.php?name=Lexikon&file=search&eid=1&query=NP">NP (i.e. can be solved by a ef="module.php?name=Lexikon&file=search&eid=1&query=nondeterministic">nondeterministic ef="module.php?name=Lexikon&file=search&eid=1&query=Turing Machine">Turing Machine in ef="module.php?name=Lexikon&file=search&eid=1&query=polynomial">polynomial time), with the additional property that it is also ef="module.php?name=Lexikon&file=search&eid=1&query=NP-hard">NP-hard. Thus a solution for one NP-complete problem would solve all problems in NP. Many (but not all) naturally arising problems in class NP are in fact NP-complete. There is always a ef="module.php?name=Lexikon&file=search&eid=1&query=polynomial-time algorithm">polynomial-time algorithm for transforming an instance of any NP-complete problem into an instance of any other NP-complete problem. So if you could solve one you could solve any other by transforming it to the solved one. The first problem ever shown to be NP-complete was the ef="module.php?name=Lexikon&file=search&eid=1&query=satisfiability problem">satisfiability problem. Another example is {Hamilton' s problem}. See also ef="module.php?name=Lexikon&file=search&eid=1&query=computational complexity">computational complexity, ef="module.php?name=Lexikon&file=search&eid=1&query=halting problem">halting problem, ef="module.php?name=Lexikon&file=search&eid=1&query=Co-NP">Co-NP, ef="module.php?name=Lexikon&file=search&eid=1&query=NP-hard">NP-hard. ef="http://fi-www.arc.nasa.gov/fia/projects/bayes-group/group/NP/">. [Other examples?] (1995-04-10)

e="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents:
[ ef="module.php?name=Lexikon&op=content&tid=134">= ] [ ef="module.php?name=Lexikon&op=content&tid=262">ad ] [ ef="module.php?name=Lexikon&op=content&tid=433">al ] [ ef="module.php?name=Lexikon&op=content&tid=492">algorithm ] [ ef="module.php?name=Lexikon&op=content&tid=531">alt ] [ ef="module.php?name=Lexikon&op=content&tid=544">am ] [ ef="module.php?name=Lexikon&op=content&tid=592">an ] [ ef="module.php?name=Lexikon&op=content&tid=740">ar ] [ ef="module.php?name=Lexikon&op=content&tid=743">arc ] [ ef="module.php?name=Lexikon&op=content&tid=800">as ] [ ef="module.php?name=Lexikon&op=content&tid=894">at ] [ ef="module.php?name=Lexikon&op=content&tid=1026">b ] [ ef="module.php?name=Lexikon&op=content&tid=1034">ba ] [ ef="module.php?name=Lexikon&op=content&tid=1157">bay ] [ ef="module.php?name=Lexikon&op=content&tid=1181">be ] [ ef="module.php?name=Lexikon&op=content&tid=1269">bi ] [ ef="module.php?name=Lexikon&op=content&tid=1606">bs ] [ ef="module.php?name=Lexikon&op=content&tid=1695">by ] [ ef="module.php?name=Lexikon&op=content&tid=1708">C ] [ ef="module.php?name=Lexikon&op=content&tid=1724">ca ] [ ef="module.php?name=Lexikon&op=content&tid=2001">ch ] [ ef="module.php?name=Lexikon&op=content&tid=2099">ci ] [ ef="module.php?name=Lexikon&op=content&tid=2138">cl ] [ ef="module.php?name=Lexikon&op=content&tid=2145">class ] [ ef="module.php?name=Lexikon&op=content&tid=2247">co ] [ ef="module.php?name=Lexikon&op=content&tid=2330">com ] [ ef="module.php?name=Lexikon&op=content&tid=2441">complete ] [ ef="module.php?name=Lexikon&op=content&tid=2451">complexity ] [ ef="module.php?name=Lexikon&op=content&tid=2484">computational complexity ] [ ef="module.php?name=Lexikon&op=content&tid=2604">Co-NP ] [ ef="module.php?name=Lexikon&op=content&tid=3136">dd ] [ ef="module.php?name=Lexikon&op=content&tid=3151">de ] [ ef="module.php?name=Lexikon&op=content&tid=3177">dec ] [ ef="module.php?name=Lexikon&op=content&tid=3187">decision problem ] [ ef="module.php?name=Lexikon&op=content&tid=3320">deterministic ] [ ef="module.php?name=Lexikon&op=content&tid=3752">du ] [ ef="module.php?name=Lexikon&op=content&tid=3865">ec ] [ ef="module.php?name=Lexikon&op=content&tid=3896">ed ] [ ef="module.php?name=Lexikon&op=content&tid=3929">ee ] [ ef="module.php?name=Lexikon&op=content&tid=4148">er ] [ ef="module.php?name=Lexikon&op=content&tid=4171">es ] [ ef="module.php?name=Lexikon&op=content&tid=4199">et ] [ ef="module.php?name=Lexikon&op=content&tid=4379">fact ] [ ef="module.php?name=Lexikon&op=content&tid=4497">fi ] [ ef="module.php?name=Lexikon&op=content&tid=4520">file ] [ ef="module.php?name=Lexikon&op=content&tid=4700">fo ] [ ef="module.php?name=Lexikon&op=content&tid=4727">for ] [ ef="module.php?name=Lexikon&op=content&tid=5276">gov ] [ ef="module.php?name=Lexikon&op=content&tid=5291">gr ] [ ef="module.php?name=Lexikon&op=content&tid=5377">group ] [ ef="module.php?name=Lexikon&op=content&tid=5434">h ] [ ef="module.php?name=Lexikon&op=content&tid=5470">halting problem ] [ ef="module.php?name=Lexikon&op=content&tid=5471">Hamilton ] [ ef="module.php?name=Lexikon&op=content&tid=5476">Hamilton' s problem ] [ ef="module.php?name=Lexikon&op=content&tid=5540">hat ] [ ef="module.php?name=Lexikon&op=content&tid=5675">hm ] [ ef="module.php?name=Lexikon&op=content&tid=5768">hr ] [ ef="module.php?name=Lexikon&op=content&tid=5779">ht ] [ ef="module.php?name=Lexikon&op=content&tid=5791">hu ] [ ef="module.php?name=Lexikon&op=content&tid=5931">id ] [ ef="module.php?name=Lexikon&op=content&tid=6013">il ] [ ef="module.php?name=Lexikon&op=content&tid=6064">in ] [ ef="module.php?name=Lexikon&op=content&tid=6179">instance ] [ ef="module.php?name=Lexikon&op=content&tid=6194">int ] [ ef="module.php?name=Lexikon&op=content&tid=6413">io ] [ ef="module.php?name=Lexikon&op=content&tid=6449">ir ] [ ef="module.php?name=Lexikon&op=content&tid=6482">is ] [ ef="module.php?name=Lexikon&op=content&tid=6558">it ] [ ef="module.php?name=Lexikon&op=content&tid=6918">la ] [ ef="module.php?name=Lexikon&op=content&tid=7023">ld ] [ ef="module.php?name=Lexikon&op=content&tid=7091">Lex ] [ ef="module.php?name=Lexikon&op=content&tid=7107">li ] [ ef="module.php?name=Lexikon&op=content&tid=7399">ls ] [ ef="module.php?name=Lexikon&op=content&tid=7410">lt ] [ ef="module.php?name=Lexikon&op=content&tid=7415">lu ] [ ef="module.php?name=Lexikon&op=content&tid=7437">lv ] [ ef="module.php?name=Lexikon&op=content&tid=7441">ly ] [ ef="module.php?name=Lexikon&op=content&tid=7457">M ] [ ef="module.php?name=Lexikon&op=content&tid=7465">Mac ] [ ef="module.php?name=Lexikon&op=content&tid=7476">Mach ] [ ef="module.php?name=Lexikon&op=content&tid=7932">mil ] [ ef="module.php?name=Lexikon&op=content&tid=8032">mo ] [ ef="module.php?name=Lexikon&op=content&tid=8040">mod ] [ ef="module.php?name=Lexikon&op=content&tid=8079">module ] [ ef="module.php?name=Lexikon&op=content&tid=8167">mp ] [ ef="module.php?name=Lexikon&op=content&tid=8228">ms ] [ ef="module.php?name=Lexikon&op=content&tid=8384">N ] [ ef="module.php?name=Lexikon&op=content&tid=8386">na ] [ ef="module.php?name=Lexikon&op=content&tid=8460">nc ] [ ef="module.php?name=Lexikon&op=content&tid=8472">ne ] [ ef="module.php?name=Lexikon&op=content&tid=8627">ng ] [ ef="module.php?name=Lexikon&op=content&tid=8630">ni ] [ ef="module.php?name=Lexikon&op=content&tid=8675">no ] [ ef="module.php?name=Lexikon&op=content&tid=8689">nondeterministic ] [ ef="module.php?name=Lexikon&op=content&tid=8744">NP ] [ ef="module.php?name=Lexikon&op=content&tid=8746">NPC ] [ ef="module.php?name=Lexikon&op=content&tid=8748">NP-hard ] [ ef="module.php?name=Lexikon&op=content&tid=8760">ns ] [ ef="module.php?name=Lexikon&op=content&tid=8820">O ] [ ef="module.php?name=Lexikon&op=content&tid=8964">om ] [ ef="module.php?name=Lexikon&op=content&tid=9014">op ] [ ef="module.php?name=Lexikon&op=content&tid=9390">PC ] [ ef="module.php?name=Lexikon&op=content&tid=9457">pe ] [ ef="module.php?name=Lexikon&op=content&tid=9550">ph ] [ ef="module.php?name=Lexikon&op=content&tid=9651">pl ] [ ef="module.php?name=Lexikon&op=content&tid=9780">Poly ] [ ef="module.php?name=Lexikon&op=content&tid=9788">polynomial ] [ ef="module.php?name=Lexikon&op=content&tid=9789">polynomial-time ] [ ef="module.php?name=Lexikon&op=content&tid=9790">polynomial-time algorithm ] [ ef="module.php?name=Lexikon&op=content&tid=9908">pr ] [ ef="module.php?name=Lexikon&op=content&tid=10253">query ] [ ef="module.php?name=Lexikon&op=content&tid=10364">rc ] [ ef="module.php?name=Lexikon&op=content&tid=10385">re ] [ ef="module.php?name=Lexikon&op=content&tid=10767">ro ] [ ef="module.php?name=Lexikon&op=content&tid=10918">S ] [ ef="module.php?name=Lexikon&op=content&tid=10922">sa ] [ ef="module.php?name=Lexikon&op=content&tid=10994">satisfiability problem ] [ ef="module.php?name=Lexikon&op=content&tid=11150">se ] [ ef="module.php?name=Lexikon&op=content&tid=11281">set ] [ ef="module.php?name=Lexikon&op=content&tid=11314">sh ] [ ef="module.php?name=Lexikon&op=content&tid=11376">si ] [ ef="module.php?name=Lexikon&op=content&tid=11651">so ] [ ef="module.php?name=Lexikon&op=content&tid=11725">solution ] [ ef="module.php?name=Lexikon&op=content&tid=11934">st ] [ ef="module.php?name=Lexikon&op=content&tid=12133">su ] [ ef="module.php?name=Lexikon&op=content&tid=12359">T ] [ ef="module.php?name=Lexikon&op=content&tid=12588">th ] [ ef="module.php?name=Lexikon&op=content&tid=12721">to ] [ ef="module.php?name=Lexikon&op=content&tid=12777">tp ] [ ef="module.php?name=Lexikon&op=content&tid=12787">tr ] [ ef="module.php?name=Lexikon&op=content&tid=12896">tt ] [ ef="module.php?name=Lexikon&op=content&tid=12925">Turing ] [ ef="module.php?name=Lexikon&op=content&tid=12926">Turing Machine ] [ ef="module.php?name=Lexikon&op=content&tid=13146">up ] [ ef="module.php?name=Lexikon&op=content&tid=13175">us ] [ ef="module.php?name=Lexikon&op=content&tid=13310">ve ] [ ef="module.php?name=Lexikon&op=content&tid=14042">ye ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (7812 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.097 Seconds, with 16 Database-Queries
Zurück zur Startseite