Viewing profile — apronchenkov

It was fun to explore the CT scan on my own, then read the article to see what was actually identified, and go back to the scan to find those things myself (despite the limitation …

I recall that in a general case finding a hamiltonian cycle (or path) is already NP-complete. Although it should be a simple problem for small real graphs, what article suggests, I…

I supposed that backspace was implemented as ``punch all holes''.