Show simple item record

dc.contributor.authorHorvath, Gabor
dc.contributor.authorNehaniv, C. L.
dc.date.accessioned2015-09-08T09:43:42Z
dc.date.available2015-09-08T09:43:42Z
dc.date.issued2015-12-01
dc.identifier.citationHorvath , G & Nehaniv , C L 2015 , ' Length of polynomials over finite groups ' , Journal of Computer and System Sciences , vol. 81 , no. 8 , pp. 1614-1622 . https://doi.org/10.1016/j.jcss.2015.05.002
dc.identifier.issn0022-0000
dc.identifier.otherPURE: 8650087
dc.identifier.otherPURE UUID: 956de9f2-e397-4bce-bcd1-3d93cd4a847d
dc.identifier.otherScopus: 84940452943
dc.identifier.urihttp://hdl.handle.net/2299/16399
dc.descriptionThis document is the Accepted Manuscript version of the following article: Gábor Horváth, and Chrystopher L. Nehaniv, ‘Length of polynomials over finite groups’, Journal of Computer and System Sicences, Vol. 81(8): 1614-1622, December 2015. The final, published version is available online at doi: https://doi.org/10.1016/j.jcss.2015.05.002.
dc.description.abstractWe study the length of polynomials over finite simple non-Abelian groups needed to realize Boolean functions. We apply the results for bounding the length of 5-permutation branching programs recognizing a Boolean set. Moreover, for Boolean and general functions on these groups, we present upper bounds on the length of shortest polynomials computing an arbitrary n-ary Boolean or general function, or a function given by another polynomial.en
dc.language.isoeng
dc.relation.ispartofJournal of Computer and System Sciences
dc.rightsEmbargoed
dc.subjectLength of polynomial functions, Simple non-Abelian groups, Nilpotent groups, Branching program, Permutation branching program
dc.titleLength of polynomials over finite groupsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.contributor.institutionAdaptive Systems
dc.description.statusPeer reviewed
dc.date.embargoedUntil2016-06-09
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeFinal Accepted Version
dcterms.dateAccepted2015-12-01
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1016/j.jcss.2015.05.002
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
rioxxterms.licenseref.startdate2016-06-09
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.date.embargo2016-06-09
herts.rights.accesstypeEmbargoed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record