OnlineWoerterBuecher.de
Internes

Lexikon

feasible


A description of an algorithm that takes polynomial time (that is, for a problem set of size N, the resources required to solve the problem can be expressed as some polynomial involving N). Problems that are "feasible" are said to be "in P" where P is polynomial time. Problems that are "possible" but not "feasible" are said to be "in NP". (2001-04-12)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ ca ] [ ch ] [ cr ] [ de ] [ du ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ Lex ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ ms ] [ N ] [ na ] [ ng ] [ no ] [ NP ] [ om ] [ ph ] [ polynomial ] [ pr ] [ pt ] [ query ] [ rc ] [ re ] [ ro ] [ sa ] [ sc ] [ script ] [ se ] [ set ] [ si ] [ so ] [ source ] [ th ] [ to ] [ ve ] [ vi ]






[ Go Back ]

Free On-line Dictionary of Computing

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