scientific article; zbMATH DE number 1961535
From MaRDI portal
Publication:4418120
zbMath1027.65032arXivmath/0202204MaRDI QIDQ4418120
Volker Kaibel, Marc E. Pfetsch
Publication date: 7 August 2003
Full work available at URL: https://arxiv.org/abs/math/0202204
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypolytopespolyhedraEuler characteristicsimplicial complexeshomologygraphsaffine equivalenceface latticescombinatorical structure
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)
Related Items
Convex hulls, oracles, and homology, Partitioning the projective plane and the dunce hat, Eigenpolytope Universality and Graphical Designs, Reachability of weakly nonlinear systems using Carleman linearization, Which nonnegative matrices are slack matrices?, Mixed-up trees: the structure of phylogenetic mixtures, Complexity of simplicial homology and independence complexes of chordal graphs, Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Shellings from relative shellings, with an application to NP-completeness, Unnamed Item, Recognizing Cartesian products of matrices and polytopes
Uses Software
