Switching functions whose monotone complexity

DOI10.1145/800133.804342MaRDI QIDQ5402551zbMATH OpenOpenAlexFDO

Authors Ingo Wegener

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804342

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 4008289
• scientific article; zbMATH DE number 3867233
• scientific article; zbMATH DE number 4095386
• On the mean complexity of monotone functions
• scientific article; zbMATH DE number 4049557

Cited in

(3)

• Complexity of monotonic functions
• scientific article; zbMATH DE number 4008289 (Why is no real title available?)
• Negation can be exponentially powerful

This page was built for publication: Switching functions whose monotone complexity

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