Computing the discrete compactness of orthogonal pseudo-polytopes via their D-EVM representation.
Pérez-Aguila, Ricardo (2010)
Mathematical Problems in Engineering
Similarity:
Displaying similar documents to “On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.”
Computing the discrete compactness of orthogonal pseudo-polytopes via their D-EVM representation.
On the computation of Clebsch-Gordan coefficients and the dilation effect.
De Loera, Jesús A., McAllister, Tyrrell B. (2006)
Experimental Mathematics
Similarity:
Hierarchical models, marginal polytopes, and linear codes
Thomas Kahle, Walter Wenzel, Nihat Ay (2009)
Kybernetika
Similarity:
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes, and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.
Triangulating a Nonconvex Polytope.
B. Chazelle, L. Palios (1990)
Discrete & computational geometry
Similarity:
A purely combinatorial proof of the Hadwiger Debrunner conjecture.
Alon, N., Kleitman, D.J. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the monotone upper bound problem.
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
Separation in the polytope algebra.
McMullen, Peter (1993)
Beiträge zur Algebra und Geometrie
Similarity:
Extendable Shelling, Simplicial and Toric h-vector of Some Polytopes
Duško Jojić (2007)
Publications de l'Institut Mathématique
Similarity:
Facet-Reducing Cuts of a Convex Polytope.
N. Prabhu (1995)
Discrete & computational geometry
Similarity: