On domains completely specifying Boolean functions

DOI10.1515/DMA.1997.7.5.465MaRDI QIDQ4522725zbMATH OpenOpenAlexFDO

Authors A. V. Chashkin

Publication date 4 January 2001

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

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

zbMATH Keywords

Boolean functioncomplexitydomainsminimal circuit

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Lower bounds for the complexity of restrictions of Boolean functions
• scientific article; zbMATH DE number 2174392
• On the complexity of restrictions of Boolean functions
• scientific article; zbMATH DE number 1498461
• scientific article; zbMATH DE number 4108153

Cited in

(3)

• Bounded complete domains and their logical form
• scientific article; zbMATH DE number 2174392 (Why is no real title available?)
• scientific article; zbMATH DE number 6155508 (Why is no real title available?)

This page was built for publication: On domains completely specifying Boolean functions

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