Computing the bounded subcomplex of an unbounded polyhedron (Q1941218): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: polymake / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q117245077 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148675558 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1006.2767 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:48, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the bounded subcomplex of an unbounded polyhedron |
scientific article |
Statements
Computing the bounded subcomplex of an unbounded polyhedron (English)
0 references
12 March 2013
0 references
unbounded polyhedron
0 references
bounded subcomplex
0 references
Hasse diagram
0 references
vertex-incidences
0 references
tight span
0 references
numerical examples
0 references
combinatorial algorithms
0 references
