Switching functions whose monotone complexity

DOI10.1145/800133.804342zbMath1282.94110OpenAlexW2079209861MaRDI QIDQ5402551

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)

Related Items (1)

Negation can be exponentially powerful

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