An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form

E. S. Bychenkova

doi:10.1515/156939203322109113

Published by De Gruyter June 1, 2003

An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form

E. S. Bychenkova

From the journal Discrete Mathematics and Applications

https://doi.org/10.1515/156939203322109113

Showing a limited preview of this publication:

We consider a problem of constructing operators of metric closeness in the n-dimensional cube in the class of automaton circuits of a special form. We study two characteristics of complexity, the spacial and temporal characteristics (the number of elements of the circuit and the time required for calculations realised by the circuit). We suggest a method of constructing the circuits realising such operators with constant running time and optimal in order number of elements.

Published Online: 2003-06-01

Published in Print: 2003-06-01

An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form

Journal and Issue

Articles in the same Issue