Exact algorithm
In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP, an exact algorithm for an NP-hard optimization problem cannot run in worst-case polynomial time. There has been extensive research on finding exact algorithms whose running time is exponential with a low base.
- Comment
- enIn computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP, an exact algorithm for an NP-hard optimization problem cannot run in worst-case polynomial time. There has been extensive research on finding exact algorithms whose running time is exponential with a low base.
- Has abstract
- enIn computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP, an exact algorithm for an NP-hard optimization problem cannot run in worst-case polynomial time. There has been extensive research on finding exact algorithms whose running time is exponential with a low base.
- Hypernym
- Algorithms
- Is primary topic of
- Exact algorithm
- Label
- enExact algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Approximation-preserving reduction
- APX
- Category:Computational complexity theory
- Category:Optimization algorithms and methods
- Computer science
- Heuristic algorithm
- NP-hardness
- Operations research
- P = NP
- Polynomial time
- Polynomial-time approximation scheme
- SameAs
- 2MZ13
- Q24963771
- Subject
- Category:Computational complexity theory
- Category:Optimization algorithms and methods
- WasDerivedFrom
- Exact algorithm?oldid=962596137&ns=0
- WikiPageLength
- 1520
- Wikipage page ID
- 48448587
- Wikipage revision ID
- 962596137
- WikiPageUsesTemplate
- Template:Reflist