On bilinear algorithms over fields of different characteristics

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Standard

On bilinear algorithms over fields of different characteristics. / Lysikov, V. V.

I: Moscow University Computational Mathematics and Cybernetics, Bind 37, Nr. 4, 31.12.2013, s. 189-194.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Harvard

Lysikov, VV 2013, 'On bilinear algorithms over fields of different characteristics', Moscow University Computational Mathematics and Cybernetics, bind 37, nr. 4, s. 189-194. https://doi.org/10.3103/S0278641913040067

APA

Lysikov, V. V. (2013). On bilinear algorithms over fields of different characteristics. Moscow University Computational Mathematics and Cybernetics, 37(4), 189-194. https://doi.org/10.3103/S0278641913040067

Vancouver

Lysikov VV. On bilinear algorithms over fields of different characteristics. Moscow University Computational Mathematics and Cybernetics. 2013 dec. 31;37(4):189-194. https://doi.org/10.3103/S0278641913040067

Author

Lysikov, V. V. / On bilinear algorithms over fields of different characteristics. I: Moscow University Computational Mathematics and Cybernetics. 2013 ; Bind 37, Nr. 4. s. 189-194.

Bibtex

@article{46b3dfa60b18429daa9abb2ec96b17a8,
title = "On bilinear algorithms over fields of different characteristics",
abstract = "Relationship between bilinear algorithms over fields of different characteristics and over different rings is investigated.",
keywords = "algebraic complexity theory, bilinear algorithms",
author = "Lysikov, {V. V.}",
year = "2013",
month = dec,
day = "31",
doi = "10.3103/S0278641913040067",
language = "English",
volume = "37",
pages = "189--194",
journal = "Moscow University Computational Mathematics and Cybernetics",
issn = "0278-6419",
publisher = "Allerton Press Inc.",
number = "4",

}

RIS

TY - JOUR

T1 - On bilinear algorithms over fields of different characteristics

AU - Lysikov, V. V.

PY - 2013/12/31

Y1 - 2013/12/31

N2 - Relationship between bilinear algorithms over fields of different characteristics and over different rings is investigated.

AB - Relationship between bilinear algorithms over fields of different characteristics and over different rings is investigated.

KW - algebraic complexity theory

KW - bilinear algorithms

UR - http://www.scopus.com/inward/record.url?scp=84891122620&partnerID=8YFLogxK

U2 - 10.3103/S0278641913040067

DO - 10.3103/S0278641913040067

M3 - Journal article

AN - SCOPUS:84891122620

VL - 37

SP - 189

EP - 194

JO - Moscow University Computational Mathematics and Cybernetics

JF - Moscow University Computational Mathematics and Cybernetics

SN - 0278-6419

IS - 4

ER -

ID: 232711719