| Tartalom: |
http://authors.elsevier.com/a/1RbPE509754EN |
| Archívum: |
MTA Könyvtár |
| Gyűjtemény: |
Status = Published
Type = Article
|
| Cím: |
Length of polynomials over finite groups
|
| Létrehozó: |
Horváth, Gábor
Nehaniv, Chrystopher L.
|
| Dátum: |
2015
|
| Téma: |
QA72 Algebra / algebra
QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
|
| Tartalmi leírás: |
We 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.
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
|
| Azonosító: |
Horváth, Gábor and Nehaniv, Chrystopher L. (2015) Length of polynomials over finite groups. Journal of Computer and System Sciences, 81 (8). pp. 1614-1622. ISSN 0022-0000
|
| Kapcsolat: |
FP7/2007-2013 under grant agreement no. 318202
|
