scientific article; zbMATH DE number 3385535

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Linear programming (90C05) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Connectionistic models of Boolean category representation, A review of combinatorial problems arising in feedforward neural network design, Analog computation via neural networks, Monotone Boolean formulas can approximate monotone linear threshold functions, Sequential testing of complex systems: a review, Dualization of regular Boolean functions, On the inverse power index problem, On Dedekind's problem for complete simple games, Decompositions of positive self-dual Boolean functions, Simple games and magic squares, Boolean minors, Generalized Knapsack problems and fixed degree separations, Classification by polynomial surfaces, On PAC learning algorithms for rich Boolean function classes, Maximal intersecting families, The cost of getting local monotonicity, Completely unimodal numberings of a simple polytope, Trading transforms of non-weighted simple games and integer weights of weighted simple games, Variable and term removal from Boolean formulae, Logical analysis of numerical data, A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting, An upper bound for the relative influence of variables on Boolean functions, Duality in a generalized model for translation invariant systems, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, Breakdown points, breakdown probabilities, midpoint sensitivity curves, and optimization of stack filters, On the geometric separability of Boolean functions, The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions, Improved approximation of linear threshold functions, Error-free and best-fit extensions of partially defined Boolean functions, Decomposition of threshold functions into bounded fan-in threshold functions, The inverse Shapley value problem, Growth of dimension in complete simple games, Nearest neighbor representations of Boolean functions, Size of ordered binary decision diagrams representing threshold functions, Variations on extending partially defined Boolean functions with missing bits., Three hierarchies of simple games parameterized by ``resource parameters, On representation and approximation of nonlinear systems. Part II: Discrete time, Forms of representation for simple games: sizes, conversions and equivalences, On the characterization of weighted simple games, Weighted and roughly weighted simple games, Interior and exterior functions of positive Boolean functions., Logical analysis of data: classification with justification, A geometric connection to threshold logic via cubical lattices, Relations between threshold and \(k\)-interval Boolean functions, Minimum self-dual decompositions of positive dual-minor Boolean functions, Inner-core and outer-core functions of partially defined Boolean functions, On the complexity of core, kernel, and bargaining set, Vote counting measures for ensemble classifiers., Threshold Boolean form for joint probabilistic constraints with random technology matrix, Root cones and the resonance arrangement, Some notes on threshold circuits, and multiplication in depth 4, An arithmetic model of computation equivalent to threshold circuits, Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions, On the cut number problem for the 4, and 5-cubes, The hardest halfspace, An \(O(n^ 3)\) recognition algorithm for bithreshold graphs, A Better Upper Bound on Weights of Exact Threshold Functions, Counting and enumerating aggregate classifiers, The communication complexity of addition, Circular nonsingular threshold transformations, Monotone clutters, Computing with discrete multi-valued neurons, Majority gates vs. general weighted threshold gates, A cascade algorithm for the logical closure of a set of binary relations, Any 2-asummable bipartite function is weighted threshold, On the size of (generalized) OBDDs for threshold functions, Cut-threshold graphs, The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs, Degree-uniform lower bound on the weights of polynomials with given sign function, Weighted committee games, Polynomial threshold functions and Boolean threshold circuits, Perceptrons of large weight, On the coverings of the \(d\)-cube for \(d\leq 6\), The fixing groups for the 2-asummable Boolean functions, An algorithm to detect linearly separable clusters of binary patterns, Representable orientations of the free spikes, On the fixing group for a totally pre-ordered Boolean function, Thresholding in a generalized model for translation invariant systems, On the existence of a minimum integer representation for weighted voting systems, Simple games and weighted games: A theoretical and computational viewpoint, Complete simple games, Decomposing 1-Sperner hypergraphs, Isotone lattice-valued Boolean functions and cuts, On the Complexity of the Decisive Problem in Simple and Weighted Games, Monotone circuits for monotone weighted threshold functions, Geometry of cut-complexes and threshold logic, Function synthesis algorithm of RTD-based universal threshold logic gate, Enumerating fuzzy switching functions and free Kleene algebras, Logical analysis of data with decomposable structures., On the complexity of learning for spiking neurons with temporal coding., On the enumeration of Boolean functions with distinguished variables, An overview of median and stack filtering, Analysis of weighted median filters based on inequalities relating the weights, Combinatorics and connectionism, The threshold order of a Boolean function, Roughly weighted hierarchical simple games, Linear function neurons: Structure and training, Logical analysis of binary data with missing bits, On the reversible and irreversible representations of motions in \(R^ n\) to \(R^ 2\), A \#SAT algorithm for small constant-depth circuits with PTF gates, Weights of exact threshold functions, CNN applications from the hardware point of view: video sequence segmentation, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Communication Lower Bounds via Critical Block Sensitivity, Some results on uniform arithmetic circuit complexity, Estimating the efficiency of threshold representations of Boolean functions, Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization, A Short List of Equalities Induces Large Sign-Rank, On the errors that learning machines will make, Neural networks and complexity theory, Unnamed Item, A note on the simulation of exponential threshold weights, Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions, Redundancy check technique for designing optimal networks by branch-and-bound method, Coefficient reduction for inequalities in 0–1 variables, Realization of threshold functions by generation of canonical weight vectors with a given sum, Facet of regular 0–1 polytopes, New algorithms and lower bounds for circuits with linear threshold gates, Averages of simplex Hilbert transforms, String Matching: Communication, Circuits, and Learning., A geometrical method in combinatorial complexity, Invariant continuous aggregation functions, Natural proofs, Generating dual-bounded hypergraphs, Optimal bounds for sign-representing the intersection of two halfspaces by polynomials, On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem, Unnamed Item, Karnaugh map analysis and synthesis of threshold functions, Karnaugh map synthesis of multigate threshold networks, Decision lists and related Boolean functions, Linear separation of connected dominating sets in graphs, A new theorem in threshold logic and its application to multioperand binary adders, Unnamed Item, A complete classification of equational classes of threshold functions included in clones, Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube, Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions, The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic, Testing 2-asummability using a property of canonical extremal vertices