█████╗ ██████╗ ██████╗██╗ ██╗██╗██╗ ██╗███████╗
██╔══██╗██╔══██╗██╔════╝██║ ██║██║██║ ██║██╔════╝
███████║██████╔╝██║ ███████║██║██║ ██║█████╗
██╔══██║██╔══██╗██║ ██╔══██║██║╚██╗ ██╔╝██╔══╝
██║ ██║██║ ██║╚██████╗██║ ██║██║ ╚████╔╝ ███████╗
╚═╝ ╚═╝╚═╝ ╚═╝ ╚═════╝╚═╝ ╚═╝╚═╝ ╚═══╝ ╚══════╝
███████╗███████╗██╗ ██╗███████╗██████╗
██╔════╝██╔════╝██║ ██║██╔════╝██╔══██╗
█████╗ █████╗ ██║ ██║█████╗ ██████╔╝
██╔══╝ ██╔══╝ ╚██╗ ██╔╝██╔══╝ ██╔══██╗
██║ ███████╗ ╚████╔╝ ███████╗██║ ██║
╚═╝ ╚══════╝ ╚═══╝ ╚══════╝╚═╝ ╚═╝
Np Engrams
Edwin Wenink by Complexity 101 and the P-NP question
Anyone working with computer algorithms sometimes has to reflect on the question what the complexity of that algorithm is. Last week I tortured my poor laptop by letting it crunch away the whole night on a planning problem using A* with the \(h_{max}\) heuristic, only to find that upon waking up 1) the cpu heat was quite critical and 2) that the …
See archives for more ...
