On the multiplicative complexity of boolean functions over the basis (AND, XOR, 1)

J. Boyar, R. Peralta, D. Pochuev

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review

Originalsprog	Engelsk
Tidsskrift	Theoretical Computer Science
Vol/bind	235
Sider (fra-til)	43-57
Antal sider	13
ISSN	0304-3975
DOI	https://doi.org/10.1016/S0304-3975(99)00182-6
Status	Udgivet - 2000

Dokumenter og links

@article{77716360ba9711dc9626000ea68e967b,

title = "On the multiplicative complexity of boolean functions over the basis (AND, XOR, 1)",

author = "J. Boyar and R. Peralta and D. Pochuev",

year = "2000",

doi = "10.1016/S0304-3975(99)00182-6",

language = "English",

volume = "235",

pages = "43--57",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - On the multiplicative complexity of boolean functions over the basis (AND, XOR, 1)

AU - Boyar, J.

AU - Peralta, R.

AU - Pochuev, D.

PY - 2000

Y1 - 2000

U2 - 10.1016/S0304-3975(99)00182-6

DO - 10.1016/S0304-3975(99)00182-6

M3 - Journal article

SN - 0304-3975

VL - 235

SP - 43

EP - 57

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -