Proving Lower Bounds for Linar Decision Trees

Marc Snir. Proving Lower Bounds for Linar Decision Trees. In Shimon Even, Oded Kariv, editors, Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Volume 115 of Lecture Notes in Computer Science, pages 305-315, Springer, 1981.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.