Please use this identifier to cite or link to this item: https://rd.uffs.edu.br/handle/prefix/2697
Full metadata record
DC FieldValueLanguage
dc.contributor.advisor1Wuerges, Emílio-
dc.creatorRogoski, Renan Roberto-
dc.date2018-
dc.date.accessioned2019-04-10T16:55:19Z-
dc.date.available2019-
dc.date.available2019-04-10T16:55:19Z-
dc.date.issued2018-
dc.identifier.urihttps://rd.uffs.edu.br/handle/prefix/2697-
dc.description.abstractSignature Functions are intended to compute compact representations that characterize some properties of Boolean functions, called signatures. Each Boolean function has a unique signature, but a signature can be related to one or more functions. Canonical forms can be used to verify that two functions are equivalent, but they are very costly, so the use of signature functions can help shorten the search space for equivalence by quickly disqualifying designs that are not equivalent.pt_BR
dc.description.resumoFunções de Assinatura visam calcular representações compactas que caracterizam algumas propriedades de funções booleanas, chamadas de assinaturas. Cada função booleana possui uma assinatura única, mas uma assinatura pode estar relacionada a uma ou mais funções. Formas canônicas podem ser usadas para verificar se duas funções, são equivalentes, porém são muito custosas, assim o uso de funções de assinatura pode ajudar a reduzir o espaço de busca para a equivalência, desclassificando rapidamente designs que não são equivalentes.pt_BR
dc.description.provenanceSubmitted by SUELEN SPINDOLA BILHAR (suelen.bilhar@gmail.com) on 2019-04-09T12:15:59Z No. of bitstreams: 1 ROGOSKI.pdf: 2280354 bytes, checksum: 9a1b366e9d6431545166516b0d97db95 (MD5)en
dc.description.provenanceApproved for entry into archive by Diego dos Santos Borba (dborba@uffs.edu.br) on 2019-04-10T16:55:19Z (GMT) No. of bitstreams: 1 ROGOSKI.pdf: 2280354 bytes, checksum: 9a1b366e9d6431545166516b0d97db95 (MD5)en
dc.description.provenanceMade available in DSpace on 2019-04-10T16:55:19Z (GMT). No. of bitstreams: 1 ROGOSKI.pdf: 2280354 bytes, checksum: 9a1b366e9d6431545166516b0d97db95 (MD5) Previous issue date: 2018en
dc.languageporpt_BR
dc.publisherUniversidade Federal da Fronteira Sulpt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentCampus Chapecópt_BR
dc.publisher.initialsUFFSpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectCiência da computaçãopt_BR
dc.subjectLógicapt_BR
dc.titleFunções de assinatura para correspondência booleanapt_BR
dc.typeMonografiapt_BR
Appears in Collections:Ciência da Computação

Files in This Item:
File Description SizeFormat 
ROGOSKI.pdf2.23 MBAdobe PDFView/Open
Show simple item record Recommend this item


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.