Every computational problem

whose every solution is a single Boolean value.

TSP can be converted to a decision problem by asking "Is there a tour with a cost less than *\(c\)*?" for some constant *\(c\)*.

© 2024 Rudolf Adamkovič under GNU General Public License version 3.

Made with Emacs and secret alien technologies of yesteryear.