OnlineWoerterBuecher.de
Internes

Lexikon


polynomial-time algorithm


Y> A known algorithm (or Turing Machine) that is guaranteed to terminate within a number of steps which is a polYnomial function of the size of the problem. See also computational complexitY, exponential time, nondeterministic polYnomial-time (NP), NP-complete. (1995-04-13)

Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ b ] [ be ] [ ch ] [ co ] [ com ] [ complete ] [ complexitY ] [ computational complexitY ] [ de ] [ deterministic ] [ du ] [ ed ] [ ee ] [ er ] [ et ] [ exponent ] [ exponential ] [ fi ] [ file ] [ function ] [ gu ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ kn ] [ Lex ] [ ls ] [ lY ] [ M ] [ Mac ] [ Mach ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ nondeterministic ] [ NP ] [ NP-complete ] [ nu ] [ om ] [ ph ] [ pl ] [ polYnomial ] [ polYnomial-time ] [ pr ] [ querY ] [ rc ] [ re ] [ ro ] [ S ] [ se ] [ si ] [ so ] [ st ] [ T ] [ tee ] [ th ] [ to ] [ Turing ] [ Turing Machine ] [ ua ] [ um ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3687 Reads)

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

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