Design algorithm of optimal NOR networks by the branch-and-bound approach View on Open Library

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

by Tomoyasu Nakagawa

No reviews yet
First published: 1984 1 language
Subjects
Branch and bound algorithms Logic design

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...

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

Comparison of the implicit enumeration m...

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 Branch and bound alg...
Branch-and-bound strategies for dynamic programming

Branch-and-bound strategies for dynamic ...

Thomas L. Morin
Automatic verification of sequential infinite-state processes

Automatic verification of sequential inf...

Olaf Burkart
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program

Results of the synthesis of optimal netw...

Jay Culliney
Optimizing binary trees grown with a sorting algorithm

Optimizing binary trees grown with a sor...

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

Pruning and branching methods for design...

Tomoyasu Nakagawa
Branch and bound methods for combinatorial problems

Branch and bound methods for combinatori...

John D. C. Little