We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
J. Paul Roth. Two logical minimization problems. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 396–401. - J. Paul Roth. Algebraic topological methods for the synthesis of switching systems. II. Proceedings of the International Symposium on the Theory of Switching, Harvard University, April 2, 1957, The annals of the computation laboratory, vol. 29 (1959), pp. 57–73. - J. Paul Roth and E. G. Wagner. Algebraic topological methods for the synthesis of switching systems. III: Minimization of nonsingtdar Boolean trees. IBM journal of research and development, vol. 3 (1959), pp. 326–344.
Review products
J. Paul Roth. Two logical minimization problems. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 396–401.
J. Paul Roth. Algebraic topological methods for the synthesis of switching systems. II. Proceedings of the International Symposium on the Theory of Switching, Harvard University, April 2, 1957, The annals of the computation laboratory, vol. 29 (1959), pp. 57–73.
J. Paul Roth and E. G. Wagner. Algebraic topological methods for the synthesis of switching systems. III: Minimization of nonsingtdar Boolean trees. IBM journal of research and development, vol. 3 (1959), pp. 326–344.
Published online by Cambridge University Press:
12 March 2014
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)