Comparison of the implicit enumeration method and the branch-and-bound method for logical design

View on Open Library

Comparison of the implicit enumeration method and the branch-and-bound method for logical design

by Tomoyasu Nakagawa

No reviews yet

First published: 1971 1 language

Subjects

Logic design Branch and bound algorithms Integer programming

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Tomoyasu Nakagawa

Pruning and branching methods for designing optimal networks by the branch-and-bound method

Pruning and branching methods for design...

Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks

Reference manual of FORTRAN program ILLO...

A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

A branch-and-bound algorithm for optimal...

A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

A branch-and-bound algorithm for optimal...

Design algorithm of optimal NOR networks by the branch-and-bound approach

Design algorithm of optimal NOR networks...

Reference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networks

Reference manual of FORTRAN program ILLO...

You Might Also Like

More in Logic design

Kokuritsu Kokkai Toshokan shozō Meijiki kankō tosho maikuro-ban shūsei

Kokuritsu Kokkai Toshokan shozō Meijiki ...

Kokuritsu Kokkai Toshokan (Japan)

The Logic of Scientific Discovery

The Logic of Scientific Discovery

Karl Popper

Digital Design

John F. Wakerly

Evaluation of Novel Approaches to Software Engineering

Evaluation of Novel Approaches to Softwa...

Leszek A. Maciaszek

Information and Communication Technologies in Education, Research, and Industrial Applications

Information and Communication Technologi...

Vadim Ermolayev

How computers work

How computers work

Ron White