Where can I find more information about the FNP complexity class? The only place I did find anything on FNP was http://en.wikipedia.org/wiki/FNP_(complexity)However, that isn't sufficient for me to understand what that class actually means. For example, what should the FNP version of the decision version of the Hamiltonian Cycle Problem be?
FNP complexity class
cc.complexity theory;complexity classes;hamiltonian paths
See the FAQ: Official FAQ for Theoretical Computer Science for more info on complexity classes. Papadimitriou's complexity textbook also has a nice explanation of FNP. As for your specific question, the FNP version is merely, given a graph G, determine if a Ham cycle exists and find it. 