Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorLi, Baiyu
dc.contributor.authorYe, Yuli
dc.date.accessioned2017-09-29 14:03:10 (GMT)
dc.date.available2017-09-29 14:03:10 (GMT)
dc.date.issued2012-01-01
dc.identifier.urihttp://dx.doi.org/10.1142/S0129054112400023
dc.identifier.urihttp://hdl.handle.net/10012/12516
dc.descriptionElectronic version of an article published as International Journal of Foundations of Computer Science, 23(01), 2012, 21–35. http://dx.doi.org/10.1142/S0129054112400023 © World Scientific Publishing Company http://www.worldscientific.com/en
dc.description.abstractTransient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for computing the output transient of a gate from the input transients are known for NOT, AND, OR and XOR gates and their complements, but, in general, even the problem of deciding whether the length of the output transient exceeds a given bound is NP-complete. We propose a method of evaluating extensions of general boolean functions. We study a class of functions for which, instead of evaluating the extensions on a given set of transients, it is possible to get the same values by using transients derived from the given ones, but having length at most 3. We prove that all functions of three variables, as well as certain other functions, have this property, and can be efficiently evaluated.en
dc.description.sponsorshipNatural Sciences and Engineering Research Council of Canada [OGP0000871]en
dc.description.sponsorshipDepartment of Computer Science, University of Torontoen
dc.language.isoenen
dc.publisherWorld Scientific Publishingen
dc.subjectAlgebraen
dc.subjectBoolean functionen
dc.subjectcircuiten
dc.subjectcomplexityen
dc.subjectevaluationen
dc.subjectgateen
dc.subjecthazarden
dc.subjectmulti-valueden
dc.subjecttransienten
dc.subjecttransient extensionen
dc.titleOn The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functionsen
dc.typeArticleen
dcterms.bibliographicCitationBrzozowski, J., Li, B., & Ye, Y. (2012). ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS. International Journal of Foundations of Computer Science, 23(01), 21–35. https://doi.org/10.1142/S0129054112400023en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2David R. Cheriton School of Computer Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages