A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
Series: Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 462; Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 462
Publisher: Dept. of Computer Science, University of Illinois
Published: 1971
Place of publication: Urbana
Language: eng
Number of pages: 39
Subjects: Branch and bound algorithms; Switching theory
Notes: Bibliography: p. 39.