On the complexity of slice functions
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 553-561
- https://doi.org/10.1007/bfb0030339
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An 0(n log n) sorting networkPublished by Association for Computing Machinery (ACM) ,1983
- Exponential lower bounds for restricted monotone circuitsPublished by Association for Computing Machinery (ACM) ,1983
- Boolean functions whose monotone complexity is of size n2log nTheoretical Computer Science, 1982
- Monotone switching circuits and boolean matrix productComputing, 1976