Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program View on Open Library

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

by Jay Culliney

No reviews yet
First published: 1976 1 language
Subjects
Branch and bound algorithms Data processing Electric network synthesis ILLOD-(AND-OR-B) Logic circuits

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Jay Culliney

Program manual

Program manual

Pruning procedures for NOR networks using permissible functions

Pruning procedures for NOR networks usin...

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation

A study of certain factors affecting com...

Use and description of the CALCOMP program to draw networks of logic gates

Use and description of the CALCOMP progr...

Pruning procedures for NOR networks using permissible functions

Pruning procedures for NOR networks usin...

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation

A study of certain factors affecting com...

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
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
Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus

Die Lösung von Reihenfolgeproblemen aus...

Gerhard Rubow