OnlineWoerterBuecher.de
Internes

Lexikon

non-polynomial


The set or property of problems for which no polynomial-time algorithm is known. This includes problems for which the only known algorithms require a number of steps which increases exponentially with the size of the problem, and those for which no algorithm at all is known. Within these two there are problems which are "provably difficult" and "provably unsolvable". (1995-04-10)

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ ch ] [ cl ] [ co ] [ com ] [ complexity ] [ cr ] [ cu ] [ de ] [ diff ] [ du ] [ er ] [ es ] [ et ] [ exponent ] [ exponential ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hm ] [ hose ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ inc ] [ include ] [ ir ] [ is ] [ it ] [ kn ] [ Lex ] [ lt ] [ lu ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ nl ] [ no ] [ ns ] [ nu ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ polynomial ] [ polynomial-time ] [ polynomial-time algorithm ] [ pr ] [ provably difficult ] [ provably unsolvable ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ set ] [ si ] [ so ] [ st ] [ T ] [ th ] [ tw ] [ um ] [ va ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2760 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0934 Seconds, with 17 Database-Queries
Zurück zur Startseite