Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
Open Access
- 30 September 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 62 (2-3) , 129-143
- https://doi.org/10.1016/s0019-9958(84)80031-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A counterexample to the generalized Aanderaa-Rosenberg conjectureInformation Processing Letters, 1978
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976