CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NPcomplete.
Laurent Hyafil and Ronald L. Rivest. Constructing Optimal Binary Decision Trees is NP-Complete. Information Processing Letters, 5(1):15--17, May 1976.
Hyafil, Laurent and Ronald L. Rivest. 1976 (May). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17.
Hyafil and Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5, 1976.
L. Hyafil and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, vol. 5, no. 1, 1976.
Hyafil, L. & Rivest, R. L. (1976), "Constructing optimal binary decision trees is NP-complete", Information Processing Letters 5(1), pp. 15--17.
L. Hayafil and R. L. Rivest, "Constructing Optimal Binary Decision Trees is NP-Complete", Information Processing Letters , 5, 1, 1976, 15-17.
Hyafil, L., and Rivest, R. L. 1976. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5:15--17.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NPcomplete. Info. Proc. Letters, 5(1):15--17, 1976.
L. Hyafile and R. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5:1:15--17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5(1):15--17, 1976.
R. L. Rivest and L. Hyafil. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, May 1976.
Rivest, R. L. and Hyafil, L. 1976. Constructing optimal binary decision trees is NP-complete.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyafil and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, vol. 5, no. 1, pp. 15--17, 1976.
L. Hyafil and R. L. Rivest. Constructing Optimal Binary Decision Trees is NPComplete. Information Processing Letters, 5:15--17, 1976.
Hyafil, L. and Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17.
Laurent Hyafil and Ronald L. Rivest. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information ProcessingLetters, 5:15--17, 1976.
Hyafil and Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5, 1976.
L. Hyafile and R. Rivest. Constructing optimal binary decision trees is npcomplete. Information Processing Letters, 5(1):15--17, 1976.
Hyafil, L., and Rivest, R. L. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5, 1 (1976), 15--17.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5:15--17, 1976.
Hyafil, L. & Rivest, R. L. (1976), "Constructing optimal binary decision trees is NPcomplete ", Information Processing Letters 5(1), 15--17.
L. Hyafil and R. Rivest, "Constructing optimal binary decision trees is NP-complete," Inform. Process. Lett., Vol. 5, No. 1, pp. 15-17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5 (1), 15--17.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is npcomplete. Information Processing Letters, 5:15--17, 1976.
Hyafil, L. and Rivest, R., "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, 5, 15-17, 1976.
Hyafil, L., and Rivest, R. 1976. Constructing optimal binary decision trees is NP-complete. Inf. Process.
Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5 (1), 15--17.
Hyafil, L., and Rivest, R. L. 1976. Constructing optimal binary decision trees is NP-complete.
Hyafil, L., and Rivest, R.L., "Constructing optimal binary decision trees is NPcomplete ", Inform. Process. Lett. 5, No.1, 1976 pp. 15-17.
Laurent Hyafil and Ronald L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NPcomplete.
Hyafil, L. & Rivest, R. L. (1976), "Constructing optimal binary decision trees is NPcomplete ", Information Processing Letters 5(1), 15--17.
L.Hyaøl, R.L.Rivest, "Constructing optimal binary decision trees is NPcomplete ", Information Processing Letters, Vol. 5, No. 1, pp. 15-17, 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
Hyafil, L. and Rivest, R., "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, 5, 15-17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, May 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. Rivest. Constructing Optimal Binary Decision Trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15--17, 1976.
L. Hyafil and R. L. Rivest, Constructing Optimal Binary Decision Trees is NP-Complete. Information Processing Letter, 5: 15--17, 1976.
L. Hayl and R. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5(1):15-17, 1976.
Hyafil, L. and Rivest, R., "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, 5, 15-17, 1976.
Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5 (1), 15--17.
L.Hyafil and R.Rivest, "constructing Optimal Binary Decision Trees is NP-Complete," Information Processing Letters, vol.5, no.1, May 1976.
Hyafil, L. and Rivest, R., "Constructing optimal binary decision trees is NP-complete," Information Processing Letters, 5, 15-17, 1976.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NP-Complete. Information Processing Letters, 5(1):15--17, 1976.
Hyafil, L. & Rivest, R. L. (1976), "Constructing optimal binary decision trees is NP-complete", Information Processing Letters 5(1), pp. 15--17.
Hyafil, L. and Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17.
L. Hyafil and R. Rivest. "Constructing optimal binary decision trees is NPcomplete, " Inform. Process. Lett., 5 (1976), 15--17.
L. Hyafil and R. Rivest, `Constructing optimal binary decision trees is NP-complete.', Information Processing Letters, 5(1), 15--17, (1976).
L. Hyal and R. L. Rivest. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5(1):15-17, May 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision tree is np-complete, 5(1). In Information Processing Letters, pages 15--17, 1996.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is np-complete. Comm. of the ACM, 5:15--17, May 1976.
L. Hyal and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
L. Hyal and R. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5(1):15-17, 1976.
L.HyafilandR.L.Rivest,"Constructing Optimal Binary Decision Trees is NP-complete", Information Processing Letters, 5(1):15-17, 1976.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyal and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
L. Hyale and R. Rivest. Constructing optimal binary decision trees is npcomplete. Information Processing Letters number 5, p. 15-17, 1976.
Hya l, L., and Rivest, R.L., \Constructing Optimal Binary Decision Trees is NP-complete", in: Information Processing Letters 5 (1976) 15-17.
Hyafil, L., and Rivest, R. L. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5, 1 (1976), 15-17.
L. Hyafil and R. L. Rivest, Constructing optimal binary decision trees is NP-complete, Information Proc. Lett., 5, pp. 15--17, 1976.
Hyafil, L., and Rivest, R. L. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5, 1 (1976), 15--17.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision tree is npcomplete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyafil and R.L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15 17, 1976.
L. Hyal and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 35(1):15--17, 1976.
Hyafil, L. and Rivest, R.L. (1976). Constructing optimal binary decision trees is NPcomplete. Information Processing Letters 5, 15--17.
L. Hya l and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15-17, 1976.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
L. Hyafil and R.L. Rivest. Constructing Optimal Binary Decision Trees is NPComplete. Information Processing Letters, 5:15-17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5:15--17, 1976.
Laurent Hyafil and Ronald L. Rivest. Constructing Optimal Binary Decision Trees is NP-Complete. Information Processing Letters, 5(1):15--17, May 1976. 22
L. Hyafil and R.L. Rivest. Constructing Optimal Binary Decision Trees is NPComplete. Information Processing Letters, 5:15-17, 1976.
L. Hyafil, R. L. Rivest, Constructing optimal binary decision trees is NP-complete, In: Information Processing Letters 5 (1), pp. 15 - 17, 1976
L. Hya l and R.L. Rivest. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5:15-17, 1976.
L. Hyafil and R.L. Rivest. Constructing Optimal Binary Decision Trees is NP-Complete. Information Processing Letters, 5:15-17, 1976.
L. Hya l and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, May 1976. 25
L. Hyafil and R.L. Rivest. Constructing Optimal Binary Decision Trees is NPComplete. Information Processing Letters, 5:15-17, 1976.
L. Hya l and R. L. Rivest. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5(1):15-17, May 1976.
Hyafil, L. and Rivest, R. L. Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5 (1976), 15-17.
L. Hyafil and R. Rivest. Constructing Optimal Binary Decision Trees is np--complete. Inf. Proc. Letters, 5, pp. 15--17, 1976
L. Hya l and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15--17, 1976.
Hya#l, L., & Rivest, R. L. #1976#. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters, 5 #1#, 15#17.
L. HYAFIL AND R. L. RIVEST, Constructing optimal binary decision trees is NP-complete, Inform. Process. Lett., 5 (1976), pp. 15--17.