Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness.
Busygin, StasComputers, Computer Science, Theoretical, Complexity Theory - Busygin, Stas. Efficient algorithms for hard computational problems.
Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness.
Busygin, Stas