The average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by integral equations. In this work this analysis is carried out for the computation of...
On the complexity of searching in trees: average-case minimizationThe well known binary search method can be described as the process of identifying some marked node from a line graph T by successively querying edges. An edge query e asks in which of the two subpaths induced by T e the ...
It has been shown that there exists a transition in the average-case complexity of tree search problems, from exponential to polynomial in the search depth. We develop a new method, called &unknown;-transformation, which makes use of thi... W Zhang,JC Pemberton - 《Artificial Intelligence》 ...
On the average-case complexity of Boolean functions under binomial distribution on their domains Given a binomial probability distribution on the n-dimensional Boolean cube, the complexity of implementation of Boolean functions by straight line program... AV Chashkin - 《Discrete Mathematics & Applicatio...
Encryption is based upon use of a binary search tree of n nodes, to construct an order-preserving encryption scheme having ( n ) complexity and even O(n), in the average case. A probability of computationally intensive updating (which renders conventional OPE impractical for ideal security) is...
Average-Case Analysis of Algorithms and Data Structures This chapter discusses the analytic methods for average-case analysis of algorithms, with special emphasis on the main algorithms and data structures used ... JS Vitter,P Flajolet - 《Algorithms & Complexity》 被引量: 402发表: 1990年 An edi...
While DecodeSearch() can be implemented using a binary search algorithm whose average complexity CodingBenefit的计算的复杂性(), ColumnsBenefit ()和CombinationBenefit ()全部线性地增长关于预期编制程序小包和接收器的数量。 当DecodeSearch ()时可以使用对分查找算法平均复杂被实施 [translate] ...
We show an almost-linear-time reduction from solving any such problem in the worst-case to solving some other problem (in the same class) on typical inputs. Furthermore, for some of these problems, we show that their average-case complexity almost equals their worst-case complexity. En ...
https://doi.org/10.1007/978-3-030-64381-2_22 On Average-Case Hardness in TFNP from One-Way Functions Keywords: TFNP · PPAD · Average-case hardness · One-way functions · Black-box separations. 615 1 Introduction The complexity class TFNP ofˆı total search problems [41], i.e...
of citations. For instance, in the case of the publications listed inTable 3, the actual total number of citations equals 30, while the expected total number of citations equals 34. Hence, the ratio of the actual and the expected total number of citations equals 30/34=0.88. The fact ...