top | item 42564218

(no title)

missing-acumen | 1 year ago

I do think there is. For instance, I can convince you that two graphs are not isomorphic while avoiding you the burden of having to do the computation yourself.

discuss

order

No comments yet.