Polynomial-time algorithms for regular set-covering and threshold synthesis
- 30 September 1985
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 12 (1), 57-69
- https://doi.org/10.1016/0166-218x(85)90040-x
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Solution of Two Difficult Combinatorial Problems with Linear AlgebraThe American Mathematical Monthly, 1982
- Regular (2, 2)-systemsMathematical Programming, 1982
- On the Unimodality of some Partition PolynomialsEuropean Journal of Combinatorics, 1982
- A characterization of threshold matroidsDiscrete Mathematics, 1980
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner PropertySIAM Journal on Algebraic Discrete Methods, 1980
- Aggregation of Inequalities in Integer ProgrammingPublished by Elsevier BV ,1977
- On Dedekind’s problem: the number of isotone Boolean functions. IITransactions of the American Mathematical Society, 1975
- Coefficient reduction for inequalities in 0–1 variablesMathematical Programming, 1974
- Bottleneck extremaJournal of Combinatorial Theory, 1970