On the complexity of the disjunctive normal form of threshold functions

DOI10.1515/DMA.2000.10.2.175MaRDI QIDQ4522868zbMATH OpenOpenAlexFDO

Authors O. V. Shabanin

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.2000.10.2.175

zbMATH Keywords

complexitydisjunctive normal formimplicantsthreshold functions

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Junta threshold for low degree Boolean functions on the slice
• The complexity of DNF of parities
• scientific article; zbMATH DE number 3877100 (Why is no real title available?)
• scientific article; zbMATH DE number 3916176 (Why is no real title available?)
• On the algorithm of detecting the essential arguments of random Boolean function

This page was built for publication: On the complexity of the disjunctive normal form of threshold functions

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