A binary representation for finite Boolean functions /
| dc.contributor.author | Teska, John Thomas, | en_US |
| dc.date.accessioned | 2013-08-16T12:24:22Z | |
| dc.date.available | 2013-08-16T12:24:22Z | |
| dc.date.issued | 1970 | en_US |
| dc.identifier.uri | https://hdl.handle.net/11244/2897 | |
| dc.format.extent | v, 50 leaves ; | en_US |
| dc.publisher | The University of Oklahoma. | en_US |
| dc.subject | Mathematics. | en_US |
| dc.subject | Algebra, Boolean. | en_US |
| dc.title | A binary representation for finite Boolean functions / | en_US |
| dc.type | Thesis | en_US |
| dc.thesis.degree | Ph.D. | en_US |
| dc.note | Source: Dissertation Abstracts International, Volume: 31-07, Section: B, page: 4215. | en_US |
| ou.identifier | (UMI)AAI7101506 | en_US |
| ou.group | Other |
Files in this item
This item appears in the following Collection(s)
-
OU - Dissertations [9348]