Pith. sign in

REVIEW

Computing the bounded subcomplex of an unbounded polyhedron

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 1006.2767 v3 pith:UUZMKDVW submitted 2010-06-14 math.CO

Sven Herrmann , Michael Joswig , Marc E. Pfetsch This is my paper · ORCID
classification math.CO
keywords boundedpolyhedronunboundedalgorithmscasecombinatorialcomputationalcomputing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results.

Discussion (0). Continue with ORCID to comment.

Pith tools