Re:P vs. NP
by alanh on Tuesday January 03, 2017 @10:57PM
(#13315562)
Any survey that mentions Borges in its introductory section is A-OK in my book.
Edit This reminds me of an assignment my Discrete Math professor, Dr. Fishel, gave me, which shows how to create (in polynomial time) a Hamiltonian circuit in any undirected graph in which every vertex is of the order ceiling(n/2) where n is the number of vertices in the graph. A C++ implementation is provided. [2007]
https://alanhogan.com/asu/hamiltonian-circuit/
Edit This reminds me of an assignment my Discrete Math professor, Dr. Fishel, gave me, which shows how to create (in polynomial time) a Hamiltonian circuit in any undirected graph in which every vertex is of the order ceiling(n/2) where n is the number of vertices in the graph. A C++ implementation is provided. [2007] https://alanhogan.com/asu/hamiltonian-circuit/