pith. machine review for the scientific record. sign in

Title resolution pending

· 2018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Finding Short Paths on Simple Polytopes

cs.DS · 2026-03-05 · accept · novelty 9.0

Computing shortest monotone paths on simple polytopes is NP-hard, implying NP-hardness for shortest simplex pivot sequences and polytope diameters, with a polynomial-time result via small simple extended formulations.

citing papers explorer

Showing 1 of 1 citing paper.

  • Finding Short Paths on Simple Polytopes cs.DS · 2026-03-05 · accept · none · ref 15

    Computing shortest monotone paths on simple polytopes is NP-hard, implying NP-hardness for shortest simplex pivot sequences and polytope diameters, with a polynomial-time result via small simple extended formulations.