Is the complexity of the seating problem equal to a similar Hamiltonian circuit (cycle)?

100 Views Asked by At

You would have to convert an instance of the seating problem to an instance of Hamiltonian circuit (cycle). Does this mean in terms of complexity if one takes a certain complexity it cannot be guaranteed that the respective other could be completed in the same complexity?

0

There are 0 best solutions below