Computational Methods in Discrete Mathematics
Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces
I. V. Pankratov,
O. A. Teploukhova Moscow
Abstract:
Some upper bounds are given for the complexity of enumerating elements in non-uniformly distributed key spaces.
UDC:
519.7
© , 2024
Fulltext:
PDF file (341 kB)