Methods OI geometry and probabilistic combinatorics in threshold logic

DOI10.1515/DMA.1992.2.4.427MaRDI QIDQ3979850zbMATH OpenOpenAlexFDO

Authors Yu. A. Zuev

Publication date 26 June 1992

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1992.2.4.427

zbMATH Keywords

hyperplanesthreshold functions

Mathematics Subject Classification ID

Partitions of sets (05A18) Boolean functions (06E30) Analytic and descriptive geometry (51N99) Circuits, networks (94C99)

Cited in

(8)

• Challenge codes for physically unclonable functions with Gaussian delays: a maximum entropy problem
• On Dedekind's problem for complete simple games
• The universality of the resonance arrangement and its Betti numbers
• Polynomial threshold functions, hyperplane arrangements, and random tensors
• Representation of geometric types of Boolean functions in three variables by algebraic threshold functions
• The implementation of Magma and 2-GOST block cipher substitutions by algebraic threshold functions
• Computing characteristic polynomials of hyperplane arrangements with symmetries
• On the approximation of high-order binary Markov chains by parsimonious models

This page was built for publication: Methods OI geometry and probabilistic combinatorics in threshold logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979850)