The Hadamard Maximum Determinant Problem

Cited in

(28)

Maximum determinants of complementary acyclic matrices of zeros and ones
The weights of Hadamard matrices
On the complexity of some basic problems in computational convexity. I. Containment problems
Covering and packing problems in lattices associated with the \(n\)-cube
The maximum determinant of \(\pm 1\) matrices
Maximal determinants of combinatorial matrices
Simplexity of the cube
On maximizing det (A\(^T\)A)
Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
Weighted Fekete points on the real line and the unit circle
Extremal problems for polynomials with real roots
Cluster partitions and fitness landscapes of the Drosophila fly microbiome
Measuring a linear approximation to weakly nonlinear MIMO systems
Threshold circuit lower bounds on cryptographic functions
Sir Thomas Muir, 1844--1934
Determinant Optimization on Binary Matrices
Optimal Weighing Designs
Some outstanding problems in the theory of matrices
On -roughly weighted games
Maximal Binary Matrices and Sum of Two Squares
Sparse weighted voting classifier selection and its linear programming relaxations
What is known about unit cubes
Zero-sum-free tuples and hyperplane arrangements
Zero-one laws for random graphs with vertices in a Boolean cube
Hadamard matrices: insights into their growth factor and determinant computations
Computational complexity of counting coincidences
Maximizing adjacency determinant over k-cyclic graphs with a unique perfect matching: a complete characterization
On a sequence of random distance graphs subject to the zero-one law

This page was built for publication: The Hadamard Maximum Determinant Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661654)