Pages that link to "Item:Q1369687"
From MaRDI portal
The following pages link to Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs (Q1369687):
Displaying 23 items.
- Combinatorics and probability. Abstracts from the workshop held April 14--20, 2013. (Q343390) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Incoherent majorities: the McGarvey problem in judgement aggregation (Q642973) (← links)
- Vectors in a box (Q715080) (← links)
- Anti-Hadamard matrices (Q800988) (← links)
- Coins and cones (Q1356015) (← links)
- Simple 0/1-polytopes (Q1964656) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- On small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Patience of matrix games (Q2444536) (← links)
- How to recycle your facets (Q2506820) (← links)
- Small Chvátal rank (Q2638380) (← links)
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes (Q2694729) (← links)
- A Better Upper Bound on Weights of Exact Threshold Functions (Q3010394) (← links)
- Siegel’s Lemma Is Sharp (Q4604374) (← links)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On some p-almost Hadamard matrices (Q5229263) (← links)
- Kissing polytopes (Q6622740) (← links)
