Polynomial-time algorithms for regular set-covering and threshold synthesis

Bradley, 1974, Coefficient reduction for inequalities in 0–1 variables, Math. Proramming, 7, 263, 10.1007/BF01585527

Chvátal, 1977, Aggregation of inequalities in integer programming, Annals Discrete Math., 1, 145, 10.1016/S0167-5060(08)70731-3

Edmonds, 1970, Bottleneck extrema, J. Combin. Theory(B), 8, 299, 10.1016/S0021-9800(70)80083-7

Euler, 1982, Regular (2,2)-systems, Math. Programming, 24, 269, 10.1007/BF01585111

Giles, 1980, A characterization of threshold matroids, Discrete Math., 30, 181, 10.1016/0012-365X(80)90119-3

Hammer, 1979, An algorithm to dualize a regular switching function, IEEE Trans. Computers, C-28, 238, 10.1109/TC.1979.1675324

T. Ibaraki, Private Communication, 1981

Karmarkar, 1984, A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373, 10.1007/BF02579150

Kleitman, 1975, On Dedekind's problem: the number of isotone Boolean functions. II, Amer. Math. Soc. Trans., 213, 373

Lawler, 1980, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput., 9, 558, 10.1137/0209042

Muroga, 1979

Odlyzko, 1982, On the unimodality of some partition polynomials, Europ. J. Combinatorics, 3, 69, 10.1016/S0195-6698(82)80010-3

Proctor, 1982, Solution of two difficult combinatorial problems with linear algebra, Amer. Math. Monthly, 89, 721, 10.2307/2975833

Quine, 1953, Two theorems about truth functions, Bol. Soc. Mat. Mexicana, 1, 64

Stanley, 1980, Weyl Groups, the hard Lefschetz theorem, and the Sperner property, SIAM J. Algebraic Discrete Methods, 1, 168, 10.1137/0601021

Winder, 1969, The status of threshold logic, RCA Review, 30, 62

Winder, 1962, Threshold Logic

Published by University Microfilms, Xerox Co. (Ann Arbor, MI, 1973).

Wolsey, 1975, Faces for a linear inequality in 0–1 variables, Math. Programming, 8, 165, 10.1007/BF01580441