scientific article; zbMATH DE number 1538119
From MaRDI portal
Publication:4518979
zbMath0966.52012arXivmath/9909177MaRDI QIDQ4518979
Publication date: 21 August 2001
Full work available at URL: https://arxiv.org/abs/math/9909177
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Weights of exact threshold functions, Rank of random half-integral polytopes — extended abstract —, Matroids from hypersimplex splits, On permutation polytopes, Permutation polytopes and indecomposable elements in permutation groups, A continuous analog for 4-dimensional objects, Hierarchical Models, Marginal Polytopes, and Linear Codes, Doubly random polytopes, On the bond polytope, Extremal edge polytopes, Approximating polyhedra with sparse inequalities, Expansion of random 0/1 polytopes, A polyhedral study of lifted multicuts, Random polytopes obtained by matrices with heavy-tailed entries, Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes, Hepp's bound for Feynman graphs and matroids, Many 2-level polytopes from matroids, The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes, Some \(0/1\) polytopes need exponential size extended formulations, A lexicographic semiorder polytope and probabilistic representations of choice, On the geometry of discrete exponential families with application to exponential random graph models, Incoherent majorities: the McGarvey problem in judgement aggregation, Cut polytope has vertices on a line, Enumeration of 2-level polytopes, Lower bounds for the simplexity of the \(n\)-cube, Characterizations of democratic systems of translates on locally compact abelian groups, Smallest singular value of random matrices and geometry of random polytopes, What is known about unit cubes, On a recognition problem on cut polytope relaxations, Connectivity of cubical polytopes, On 0-1 polytopes with many facets, Strong IP formulations need large coefficients, Revlex-initial 0/1-polytopes, Foundations of space-time finite element methods: polytopes, interpolation, and integration, How to recycle your facets, Equivalence classes of full-dimensional 0/1-polytopes with many vertices, Approximation of convex sets by polytopes, Around Borsuk's hypothesis, On the existence of 0/1 polytopes with high semidefinite extension complexity, The degree of a tropical basis, A general computer program for the Bell detection loophole, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization, On permutation polytopes: notions of equivalence, Short simplex paths in lattice polytopes
