20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Search Problem: Computational Complexity Theory, Computability Theory, Decision Problem -

English
2026-03-15
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding a structure y into an object x. An algorithm is said to solve the problem if it behaves in the following way : if at least one corresponding structure exists, then one occurr ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding a structure y into an object x. An algorithm is said to solve the problem if it behaves in the following way : if at least one corresponding structure exists, then one occurrence of this structure is outputted; otherwise, the algorithm stops with an appropriate output ("Item not found" or any message of the like). For instance, such problems occurs very frequently in graph theory, where searching graphs for structures such as particular matching, cliques, independent set, etc. are subjects of interest.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131157059
Write Your Own Review
You're reviewing: Search Problem: Computational Complexity Theory, Computability Theory, Decision Problem
Your Rating:

Goodreads Reviews

€156.58 €195.73