tag:blogger.com,1999:blog-3722233.post889555349371097512..comments2024-10-10T06:29:39.038-05:00Comments on Computational Complexity: The Roeder Problem was Solved Before I Posed it (how we missed it) Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3722233.post-49862734885218075892022-04-25T17:07:15.336-05:002022-04-25T17:07:15.336-05:00I wonder about the complexity of the following pro...I wonder about the complexity of the following problem: Given a list of distinct positive integers, is there a permutation of that list that is a Roeder sequence. Equivalently does the divisor graph for those integers have a Hamiltonian path? Lance Fortnowhttps://www.blogger.com/profile/06752030912874378610noreply@blogger.comtag:blogger.com,1999:blog-3722233.post-71200600398468058592022-04-25T09:53:13.896-05:002022-04-25T09:53:13.896-05:00The finite case is indeed a fun coding problem. Su...The finite case is indeed a fun coding problem. Suitable for integer programming (at least up to n=600). https://github.com/AustinLBuchanan/divisor_graph_path_problemAustin Buchananhttps://www.blogger.com/profile/12452507762013009231noreply@blogger.com