Search problem
id:
search-problem-294-11516236
title:
Search problem
text:
In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding structure "y" in object "x". An algorithm is said to solve the problem if at least one corresponding structure exists, and then one occurrence of this structure is made output; otherwise, the algorithm stops with an appropriate output ("not found" or any message of the l
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Search_problem
date created:
date modified:
2023-01-18T01:54:37Z
main entity:
{"identifier":"Q2362762","url":"https://www.wikidata.org/entity/Q2362762"}
image:
fields total:
13
integrity:
13