On the complexity of numbering operators

A. E. ANDREEV; I. A. VIKHLYANTSEV

doi:10.1515/dma.1996.6.6.549

Home Mathematics On the complexity of numbering operators

Article

Licensed

Unlicensed Requires Authentication

On the complexity of numbering operators

A. E. ANDREEV and I. A. VIKHLYANTSEV

Published/Copyright: October 9, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 6 Issue 6

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

ANDREEV, A. E. and VIKHLYANTSEV, I. A.. "On the complexity of numbering operators" Discrete Mathematics and Applications, vol. 6, no. 6, 1996, pp. 549-562. https://doi.org/10.1515/dma.1996.6.6.549

ANDREEV, A. & VIKHLYANTSEV, I. (1996). On the complexity of numbering operators. Discrete Mathematics and Applications, 6(6), 549-562. https://doi.org/10.1515/dma.1996.6.6.549

ANDREEV, A. and VIKHLYANTSEV, I. (1996) On the complexity of numbering operators. Discrete Mathematics and Applications, Vol. 6 (Issue 6), pp. 549-562. https://doi.org/10.1515/dma.1996.6.6.549

ANDREEV, A. E. and VIKHLYANTSEV, I. A.. "On the complexity of numbering operators" Discrete Mathematics and Applications 6, no. 6 (1996): 549-562. https://doi.org/10.1515/dma.1996.6.6.549

ANDREEV A, VIKHLYANTSEV I. On the complexity of numbering operators. Discrete Mathematics and Applications. 1996;6(6): 549-562. https://doi.org/10.1515/dma.1996.6.6.549

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1996

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

Valerii Borisovich Kudryavtsev. On the Sixtieth Birthday
On the automaton model of the learning process
On the synthesis of minimal sources
On the complexity of numbering operators
On coding of discrete figures
Bounds for the number of threshold functions
A lower bound for the complexity of information networks for one partial order relation
Automaton complexity of two-place Boolean bases
On simple universal mosaic homogeneous structures
On the recovery of segmentation of dynamic images
On an algebra of pictures

Search journal Search the content of this journal

https://doi.org/10.1515/dma.1996.6.6.549

Articles in the same Issue

Valerii Borisovich Kudryavtsev. On the Sixtieth Birthday
On the automaton model of the learning process
On the synthesis of minimal sources
On the complexity of numbering operators
On coding of discrete figures
Bounds for the number of threshold functions
A lower bound for the complexity of information networks for one partial order relation
Automaton complexity of two-place Boolean bases
On simple universal mosaic homogeneous structures
On the recovery of segmentation of dynamic images
On an algebra of pictures