scientific article; zbMATH DE number 609985

zbMATH Open0819.94030MaRDI QIDQ4301458FDOQ4301458

Authors: M. I. Grinchuk 

Publication date: 31 August 1995

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

Recommendations

• scientific article; zbMATH DE number 23013
• Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
• scientific article; zbMATH DE number 4172394
• Lower bounds to the complexity of symmetric Boolean functions
• Publication:3470421
• scientific article; zbMATH DE number 15477
• Publication:4888933
• scientific article; zbMATH DE number 850402
• Circuit complexity of symmetric Boolean functions in antichain basis
• scientific article; zbMATH DE number 4035741

zbMATH Keywords

symmetric Boolean functionsswitching circuitscontact schemescomplexity of normal sequences

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited In (5)

• A simplified proof of a lower complexity estimate
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
• The complexity of the standard multiplexer function in a class of switching circuits

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 Q4301458)