Content deleted Content added
No edit summary |
Astenosfear (talk | contribs) See also: parameterized approximation |
||
Line 87:
=== A hierarchy ===
The '''A hierarchy''' is a collection of computational complexity classes similar to the W hierarchy. However, while the W hierarchy is a hierarchy contained in NP, the A hierarchy more closely mimics the [[polynomial-time hierarchy]] from classical complexity. It is known that A[1] = W[1] holds.
== See also ==
* [[Parameterized approximation algorithm]], for [[Optimization problem|optimization problems]] an algorithm running in FPT time might [[Approximation algorithm|approximate]] the solution.
== Notes ==
|