- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 21 to 30 of 50 (0.04 seconds)Spelling suggestions: "subject:"algebra, boolean"" "subject:"algebra, oxoolean""
| 21 |
Méthodes intéractives pour la synthèse des systèmes combinatoires à l'aide du système graphique CDC 1700-274.Mezzour, Abdelali. January 1971 (has links)
No description available.
|
| 22 |
An approach to unified methodology of combinational switching circuits /Cerny, Eduard. January 1975 (has links)
No description available.
|
| 23 |
An algorithm for NAND synthesis by ascending the Boolean treeChen, Len-Rong, January 1967 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1967. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
|
| 24 |
Cycle length distribution and hamming distance behavior of time-reversible boolean network model /Zhang, Zhitong. January 2000 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Physics, December 2000. / Includes bibliographical references. Also available on the Internet.
|
| 25 |
Toward optimal tree construction of monotone functionsChen, Miao. Unknown Date (has links)
Thesis (M.S.)--Duquesne University, 2005. / Title from document title page. Abstract included in electronic submission form. Includes bibliographical references (p. 21) and index.
|
| 26 |
Synthesis of tributary switching networks using two-input cellsPlisch, Donovan Charles, January 1965 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1965. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. 76.
|
| 27 |
Unitarily invariant subalgebras of C(S₂n₋₁)Kane, Jonathan Michael. January 1980 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1980. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 94-95).
|
| 28 |
An approach to unified methodology of combinational switching circuits /Cerny, Eduard. January 1975 (has links)
No description available.
|
| 29 |
Méthodes intéractives pour la synthèse des systèmes combinatoires à l'aide du système graphique CDC 1700-274.Mezzour, Abdelali. January 1971 (has links)
No description available.
|
| 30 |
A transition calculus for Boolean functionsTucker, Jerry Hassell January 1974 (has links)
A transition calculus is developed for describing and analyzing the dynamic behavior of logic circuits. Boolean partial derivatives are introduced that are more powerful and applicable to a wider class of problems than the Boolean difference. The partial derivatives are used to define a Boolean differential which provides a concise method for describing the effect on a switching function of changes in its variables. It is shown that a nonconstant function is uniquely determined by its differential, and integration techniques are developed for finding a function when its differential is known. The useful concepts of exact integrals, compatible integrals, and integration by parts are introduced and the conditions for their existence are established. Algorithms for both differentiation and integration are simply implemented using Karnaugh maps. / Ph. D.
|
Page generated in 0.0444 seconds