Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs
Open Access
- 1 July 1997
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 79 (1) , 133-160
- https://doi.org/10.1006/jcta.1997.2780
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The geometry of coin-weighing problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Coin-Weighing ProblemsThe American Mathematical Monthly, 1995
- A new competitive algorithm for the counterfeit coin problemInformation Processing Letters, 1994
- On the Size of Weights for Threshold GatesSIAM Journal on Discrete Mathematics, 1994
- The smallestn-uniform hypergraph with positive discrepancyCombinatorica, 1987
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theoryJournal of Combinatorial Theory, Series A, 1986
- Anti-Hadamard matricesLinear Algebra and its Applications, 1984
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical FormSIAM Review, 1976
- Note on matrices with a very ill-conditioned eigenproblemNumerische Mathematik, 1972
- On the value of determinantsProceedings of the American Mathematical Society, 1963