On the Complexity of Polynomial Recurrence Sequences

PII

S055529230001315-0-1

DOI

Publication type

Article

Status

Published

Authors

Affiliation:
Address: Russian Federation

Journal name

Edition

Pages

67-72

Abstract

Keywords

Received

12.10.2018

Publication date

12.10.2018

Number of characters

601

Cite Download pdf To download PDF you should sign in

GOST	Marchenkov S. On the Complexity of Polynomial Recurrence Sequences // Problemy peredachi informatsii – 2018. – V. 54. – Issue 3 C. 67-72 [Electronic resource]. URL: http://ras.jes.su/ppi/s207987840000560-5-1-en (circulation date: 03.05.2024). DOI: 10.31857/S055529230001315-0
MLA	Marchenkov, S. "On the Complexity of Polynomial Recurrence Sequences." Problemy peredachi informatsii 54.3 (2018):67-72. DOI: 10.31857/S055529230001315-0
APA	Marchenkov S. (2018). On the Complexity of Polynomial Recurrence Sequences. Problemy peredachi informatsii 54(3), pp.67-72 DOI: 10.31857/S055529230001315-0

Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

Readers community rating: votes 0

1. Kholl M. Kombinatorika. M.: Mir, 1970.

2. Nechaev V.I. Ehlementy kriptografii: Osnovy teorii zaschity informatsii. M.: Vyssh. shk., 1999.

3. Marchenkov S.S. O slozhnosti vozvratnykh posledovatel'nostej // Diskret. matem. 2003. T. 15. № 2. S. 52–62.

4. Minskij M. Vychisleniya i avtomaty. M.: Mir, 1971.

5. Akho A., Khopkroft Dzh., Ul'man Dzh. Postroenie i analiz vychislitel'nykh algoritmov. M.: Mir, 1979.