Turnpike problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 11:0111:01, 10 October 2022‎ Admin talk contribs‎ 897 bytes +897‎ Created page with "== Problem Description== The turnpike problem, also known as the partial digest problem, is: Given a multiset of (:) positive numbers AX, does there exist a set X such that AX is exactiy the multiset of al1 positive pairwise difierences of the elements of X. The complexity of the problem is aot known. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikit..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Turnpike_problem"