Book Reading Time
Home
Subjects
Calculator
About
Contact
Search
T
Tomoyasu Nakagawa
11 books found
Books by Tomoyasu Nakagawa
Pruning and branching methods for designing optimal networks by the branch-and-bound method
Tomoyasu Nakagawa
⏱ 59m
Pruning and branching methods for designing optimal networks by the branch-and-bound method
Tomoyasu Nakagawa
1971
59 pp.
Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks
Tomoyasu Nakagawa
⏱ 1h 9m
Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks
Tomoyasu Nakagawa
1971
69 pp.
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
Tomoyasu Nakagawa
⏱ 29m
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
Tomoyasu Nakagawa
1971
29 pp.
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
Tomoyasu Nakagawa
⏱ 39m
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
Tomoyasu Nakagawa
1971
39 pp.
Comparison of the implicit enumeration method and the branch-and-bound method for logical design
Tomoyasu Nakagawa
⏱ 1h 34m
Comparison of the implicit enumeration method and the branch-and-bound method for logical design
Tomoyasu Nakagawa
1971
94 pp.
Design algorithm of optimal NOR networks by the branch-and-bound approach
Tomoyasu Nakagawa
⏱ 35m
Design algorithm of optimal NOR networks by the branch-and-bound approach
Tomoyasu Nakagawa
1984
35 pp.
Reference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networks
Tomoyasu Nakagawa
⏱ 1h 20m
Reference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networks
Tomoyasu Nakagawa
1977
80 pp.
Comparison of the implicit enumeration method and the branch-and-bound method for logical design
Tomoyasu Nakagawa
⏱ 1h 34m
Comparison of the implicit enumeration method and the branch-and-bound method for logical design
Tomoyasu Nakagawa
1971
94 pp.
Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks
Tomoyasu Nakagawa
⏱ 1h 9m
Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks
Tomoyasu Nakagawa
1971
69 pp.
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
Tomoyasu Nakagawa
⏱ 29m
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
Tomoyasu Nakagawa
1971
29 pp.
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
Tomoyasu Nakagawa
⏱ 39m
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
Tomoyasu Nakagawa
1971
39 pp.