Re:Algorithm Solves Graph Isomorphism in Record Time (2015)
by mehrdadn on Friday May 24, 2019 @07:12PM
(#20006089)
You're talking about closure of EXPTIME under polynomial transformations. You could do similar for quasipolynomial and such; there's nothing about EXPTIME that makes it special in this regard. Edited my comment slightly to hopefully clarify.
[ Parent
| on HN ]
There are no comments on this comment yet.