MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Constructing Optimal Binary Decision Trees is NP-Complete." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

ATOM

vid L. Dill. Sequential Cirsuit Veri�cation Using Symbolic Model
by Ahp R. Alur, G. Holzmann, D. Peled, An Analyzer, Message Sequence, Bcl Jerry R. Burch, Edmund M. Clarke, David E. Long Representing, Bcmd Jerry R. Burch, Edmund M. Clarke, Kenneth L. Mcmillan
…. Constructing Optimal Binary Decision Trees is NP�Complete. In IPL 5, pages 15�17, 1976. �HS66� J. Hartmanis…
Add To MetaCart

Optimizing Expert Systems: Heuristics for Efficiently Generating
by Michael V. Mannino, Vijay S. Mookerjee — 1999 — Low Cost Information Acquisition Strategies,” INFORMS Journal on Computing
… acquisition problem is difficult. Hyafil and Rivest [11] proved that constructing an optimal binary decision…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 2.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB