Algorithm - Problem

A problem in algorithm is what need to be solved.

Properties

Decidable / Undecidable

• Problems that cannot be solved by computation are called undecidable
• Problems that can be solved by computer are called decidable

Tractable / Intractable

• Tractable: a problem that can be solved in polynomial time
• intractable: a problem that can NOT be solved in polynomial time

Management

Analysis

Discover More
Algorithm

An is a (procedure|method) for solving a problem. If there exists an algorithm, the function that performs it is called computable. Study of algorithms dates at least to Euclid and were formalized by...
Algorithm - (Case|problem) analysis

Type of case problem in algorithm. “Average case” analysis is the calculation of the average running time of an algorithm under some assumption (ie the relative frequencies (distribution) of...
Decidability (Undecidable or Decidable problem)

Decidability is the question of what can or cannot be done by a computer. Problems that cannot be solved by computation are called undecidable Problems that can be solved by computer are called decidable...
Tractable / Intractable Problem

Tractable: a problem that can be solved in polynomial time intractable: a problem that can NOT be solved in polynomial time the problems that can be solved by a computer using no more time than...