Methods OI geometry and probabilistic combinatorics in threshold logic

YU. A. ZUEV

doi:10.1515/dma.1992.2.4.427

Enjoy 40% off

academic books on De Gruyter Brill *

Use code

DGBHOLIDAY40

Valid until Dec 11

* Terms and conditions apply

Home Methods OI geometry and probabilistic combinatorics in threshold logic

Article

Licensed

Unlicensed Requires Authentication

Methods OI geometry and probabilistic combinatorics in threshold logic

YU. A. ZUEV

Published/Copyright: October 9, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 2 Issue 4

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

ZUEV, YU. A.. "Methods OI geometry and probabilistic combinatorics in threshold logic" Discrete Mathematics and Applications, vol. 2, no. 4, 1992, pp. 427-438. https://doi.org/10.1515/dma.1992.2.4.427

ZUEV, Y. (1992). Methods OI geometry and probabilistic combinatorics in threshold logic. Discrete Mathematics and Applications, 2(4), 427-438. https://doi.org/10.1515/dma.1992.2.4.427

ZUEV, Y. (1992) Methods OI geometry and probabilistic combinatorics in threshold logic. Discrete Mathematics and Applications, Vol. 2 (Issue 4), pp. 427-438. https://doi.org/10.1515/dma.1992.2.4.427

ZUEV, YU. A.. "Methods OI geometry and probabilistic combinatorics in threshold logic" Discrete Mathematics and Applications 2, no. 4 (1992): 427-438. https://doi.org/10.1515/dma.1992.2.4.427

ZUEV Y. Methods OI geometry and probabilistic combinatorics in threshold logic. Discrete Mathematics and Applications. 1992;2(4): 427-438. https://doi.org/10.1515/dma.1992.2.4.427

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1992

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

Polyhedral aspects of multi-index axial transportation problems
Hardly realizable Boolean functions and hardly computable real numbers
On isomorphisms of incidence algebras
An asymptotic formula for the number of correlation-immune of order k Boolean functions
Methods OI geometry and probabilistic combinatorics in threshold logic
On insecurity of cryptosystems based on generalized Reed-Solomon codes
On the number of substitutions with cycle lengths from a given set

Search journal Search the content of this journal

https://doi.org/10.1515/dma.1992.2.4.427

Articles in the same Issue

Polyhedral aspects of multi-index axial transportation problems
Hardly realizable Boolean functions and hardly computable real numbers
On isomorphisms of incidence algebras
An asymptotic formula for the number of correlation-immune of order k Boolean functions
Methods OI geometry and probabilistic combinatorics in threshold logic
On insecurity of cryptosystems based on generalized Reed-Solomon codes
On the number of substitutions with cycle lengths from a given set