Pith. sign in

REVIEW

On the Complexity of Instationary Gas Flows

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.08748 v1 pith:KDG7HOAW submitted 2017-08-29 math.OC cs.DM

Martin Gro{ss} , Marc E. Pfetsch , Martin Skutella This is my paper · ORCID
classification math.OCcs.DM
keywords instationaryflowscomplexitystationaryalreadyb-flowscasesconsisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study a simplistic model of instationary gas flows consisting of a sequence of k stationary gas flows. We present efficiently solvable cases and NP-hardness results, establishing complexity gaps between stationary and instationary gas flows (already for k=2) as well as between instationary gas s-t-flows and instationary gas b-flows.

Discussion (0). Continue with ORCID to comment.

Pith tools