Average-case complexity of elementary Boolean functions

DOI10.1515/DMA.2001.11.1.71MaRDI QIDQ4809512zbMATH OpenOpenAlexFDO

Authors A. V. Chashkin

Publication date 30 August 2004

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Average case complexity for finite Boolean functions
• Stochastic Algorithms: Foundations and Applications
• Bounds for the average-case complexity of monotone Boolean functions
• On the average-case complexity of underdetermined functions
• scientific article; zbMATH DE number 1037955

Cited in

(7)

• Stochastic Algorithms: Foundations and Applications
• Average case complexity for finite Boolean functions
• On the average-case complexity of underdetermined functions
• Bounds for the average-case complexity of monotone Boolean functions
• scientific article; zbMATH DE number 1543307 (Why is no real title available?)
• On the average-case complexity of Boolean functions under binomial distribution on their domains
• On the implementation of monotone Boolean functions by memoryless programs

This page was built for publication: Average-case complexity of elementary Boolean functions

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