| http://dbpedia.org/ontology/abstract
|
In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck.
|
| http://dbpedia.org/ontology/wikiPageID
|
22727353
|
| http://dbpedia.org/ontology/wikiPageLength
|
5454
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1039414248
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Dynamic_programming +
, http://dbpedia.org/resource/Search_games +
, http://dbpedia.org/resource/Competitive_ratio +
, http://dbpedia.org/resource/Richard_E._Bellman +
, http://dbpedia.org/resource/Linear_search +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Donald_J._Newman +
, http://dbpedia.org/resource/Category:Computational_problems +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/Minimax +
, http://dbpedia.org/resource/Anatole_Beck +
, http://dbpedia.org/resource/Online_algorithm +
, http://dbpedia.org/resource/Shmuel_Gal +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:When +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Computational_problems +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Linear_search_problem?oldid=1039414248&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Linear_search_problem +
|
| owl:sameAs |
http://sr.dbpedia.org/resource/%D0%9F%D1%80%D0%BE%D0%B1%D0%BB%D0%B5%D0%BC_%D0%BB%D0%B8%D0%BD%D0%B5%D0%B0%D1%80%D0%BD%D0%B5_%D0%BF%D1%80%D0%B5%D1%82%D1%80%D0%B0%D0%B3%D0%B5 +
, http://rdf.freebase.com/ns/m.05zlwck +
, https://global.dbpedia.org/id/4qadB +
, http://dbpedia.org/resource/Linear_search_problem +
, http://yago-knowledge.org/resource/Linear_search_problem +
, http://www.wikidata.org/entity/Q6553518 +
|
| rdf:type |
http://dbpedia.org/class/yago/Attribute100024264 +
, http://dbpedia.org/class/yago/Condition113920835 +
, http://dbpedia.org/class/yago/State100024720 +
, http://dbpedia.org/class/yago/Problem114410605 +
, http://dbpedia.org/class/yago/WikicatComputationalProblems +
, http://dbpedia.org/ontology/Disease +
, http://dbpedia.org/class/yago/Difficulty114408086 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
|
| rdfs:comment |
In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck.
|
| rdfs:label |
Linear search problem
|
