scientific article

zbMATH Open0732.94017MaRDI QIDQ3360126

Valdas Dičiūnas

Publication date: 1989

Title of this publication is not available (Why is that?)

zbMATH Keywords

linear functionsthreshold circuitscomplexity of realization of symmetrical Boolean functionshyperplanslower and upper estimationsmonotonic threshold function

Mathematics Subject Classification ID

Related Items (3)

The complexity of computing symmetric functions using threshold circuits ⋮ Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates ⋮ On minimal π-circuits of closing contacts for symmetric functions with threshold 2

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Negation-limited circuit complexity of symmetric functions 👍 👎
• New upper bounds on the Boolean circuit complexity of symmetric functions 👍 👎
• The complexity of computing symmetric functions using threshold circuits 👍 👎
• Minimal contact circuits for symmetric threshold functions 👍 👎
• Complexity and structure of near-minimal contact circuits for elementary symmetric functions 👍 👎
• Reversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure 👍 👎
• Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates 👍 👎

This page was built for publication:

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