| 31. | As of August 2016, the exact run-time complexity of envy-freeness is still unknown.
|
| 32. | Then the time complexity for this attack is n, requiring n known distinct p / c pairs.
|
| 33. | The worst case time complexity of Shoup's algorithm has a factor \ sqrt { p }.
|
| 34. | In the related key setting, the data complexity is 2 33 and the time complexity 2 64.
|
| 35. | An implementation described by Donald Knuth achieves the time complexity log " n " ) } }.
|
| 36. | Use of Schreier vectors to perform this requires less storage space and time complexity than storing these g explicitly.
|
| 37. | The caching and opportunity for good time complexity suggest to me that it could be very robust to expansion.
|
| 38. | Again one interesting part is that the sample and the time complexity does not depend on \ textstyle n.
|
| 39. | They also describe collision attack with 2 181 time complexity and 2 64 memory requirement in the same paper.
|
| 40. | Linear time is the best possible time complexity in situations where the algorithm has to sequentially read its entire input.
|
