Relative Definability of Boolean Functions via Hypergraphs
| dc.contributor.author | Bucciarelli, Antonio | |
| dc.contributor.author | Malacaria, Pasquale | |
| dc.date.accessioned | 2013-12-30T13:42:31Z | |
| dc.date.available | 2013-12-30T13:42:31Z | |
| dc.date.issued | 2013-12-30 | |
| dc.identifier.issn | 1470-5559 | |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/5021 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | Department of Computer Science Research Reports;RR-00-03 - August 2000 | |
| dc.title | Relative Definability of Boolean Functions via Hypergraphs | en_US |
| dc.type | Technical Report | en_US |
Files in this item
This item appears in the following Collection(s)
-
Department of Computer Science Research Reports: 2000 - 2008 [56]
Technical Reports of the Department of Computer Science for the years 2000 - 2008
