Partition of Space
From MaRDI portal
Publication:5841254
DOI10.2307/2303424zbMath0061.30609OpenAlexW4242409733MaRDI QIDQ5841254
Publication date: 1943
Full work available at URL: https://doi.org/10.2307/2303424
Related Items
The complexity of cells in three-dimensional arrangements, Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums, Do voters vote ideologically?, Convex cones, integral zonotopes, limit shape, Reverse search for enumeration, A class of optimization problems motivated by rank estimators in robust regression, On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron, On a generalization of Zaslavsky's theorem for hyperplane arrangements, Enhancements on the hyperplanes arrangements in mixed-integer programming techniques, Partial identification in nonseparable binary response models with endogenous regressors, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Two-colouring inequalities for euclidean arrangements in general position, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search, Nonparametric Maximum Likelihood Methods for Binary Response Models With Random Coefficients, Arrangements of planes in space, An exact algorithm for finding a vector subset with the longest sum, Complexity of computing interval matrix powers for special classes of matrices., Total polynomials of uniform oriented matroids, New bounds on the unconstrained quadratic integer programming problem, Bounding the number of \(k\)-faces in arrangements of hyperplanes, Typechecking top-down XML transformations: Fixed input or output schemas, Efficient mode enumeration of compositional hybrid systems, On the number of separable partitions, Divisions of Space by Parallels, The \(m=1\) amplituhedron and cyclic hyperplane arrangements, Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums, The use of edge-directions and linear programming to enumerate vertices, A polynomially solvable case of the pooling problem, The partition bargaining problem, Algorithms for weak and wide separation of sets, Optimal complexity reduction of polyhedral piecewise affine systems, On the gap between the quadratic integer programming problem and its semidefinite relaxation, Parametric Lagrangian dual for the binary quadratic programming problem, How good is the information theory bound in sorting?, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Probabilistic communication complexity, Polyhedral circuits and their applications, A combinatorial analysis of topological dissections, A new polynomially solvable class of quadratic optimization problems with box constraints, On the enumeration of a certain type of hyperplane arrangements, Constructions and complexity of secondary polytopes, The expected number of extreme points of a random linear program, Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy, A generalization of a formula of Steiner, Unnamed Item, The number of partitions of a set of N points in k dimensions induced by hyperplanes, Random polytopes: Their definition, generation and aggregate properties, On the number of domains of maximal dimension in partitions of projective spaces by hyperplane arrangements, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors, On the Newton polytope of the resultant
