Article
Licensed
Unlicensed
Requires Authentication
Estimates of the complexity of a method to solve the problem of inclusive search
-
E. E. GASANOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 2000
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Titelei
- Statistical problems related to generation of discrete random sequences
- On the passage time of the maximum of a critical branching process in a random environment and of a stopped random walk
- The probabilities of right decoding for a channel with additive Gaussian noise and a binary symmetric channel with random choice of code words
- On the entropy of hereditary classes of coloured graphs
- Functional aspects of the completeness problem for some classes of automaton functions
- Estimates of the complexity of a method to solve the problem of inclusive search
- Linear recursive MDS codes of dimensions 2 and 3
Articles in the same Issue
- Titelei
- Statistical problems related to generation of discrete random sequences
- On the passage time of the maximum of a critical branching process in a random environment and of a stopped random walk
- The probabilities of right decoding for a channel with additive Gaussian noise and a binary symmetric channel with random choice of code words
- On the entropy of hereditary classes of coloured graphs
- Functional aspects of the completeness problem for some classes of automaton functions
- Estimates of the complexity of a method to solve the problem of inclusive search
- Linear recursive MDS codes of dimensions 2 and 3
