An Effective Approach to Analyze Algorithms with Linear O(n) Worst-Case Asymptotic Complexity
نویسندگان
چکیده
منابع مشابه
On the worst case complexity of potential reduction algorithms for linear programming
There are several classes of interior point algorithms that solve linear programming problems in O(Vin L) iterations, but it is not known whether this bound is tight for any interior point algorithm. Among interior point algorithms, several potential reduction algorithms combine both theoretical (O(+/E L) iterations) and practical efficiency as they allow the flexibility of line searches in the...
متن کاملBoolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
Recent work on searchable symmetric encryption (SSE) has focused on increasing its expressiveness. A notable example is the OXT construction (Cash et al., CRYPTO ’13 ) which is the first SSE scheme to support conjunctive keyword queries with sub-linear search complexity. While OXT efficiently supports disjunctive and boolean queries that can be expressed in searchable normal form, it can only h...
متن کاملA Genetic Approach to Analyze Algorithm Performance Based on the Worst-Case Instances
Search-based software engineering has mainly dealt with automated test data generation by metaheuristic search techniques. Similarly, we try to generate the test data (i.e., problem instances) which show the worst case of algorithms by such a technique. In this paper, in terms of non-functional testing, we re-define the worst case of some algorithms, respectively. By using genetic algorithms (G...
متن کاملUsing software complexity measures to analyze algorithms - an experiment with the shortest-paths algorithms
In this paper, we apply di1erent software complexity measures to a set of shortest-path algorithms. Our intention is to study what kind of new information about the algorithms the complexity measures (lines-of-code, Halstead’s volume, and cyclomatic number) are able to give, to study which software complexity measures are the most useful ones in algorithm comparison, and to analyze when the sof...
متن کاملWorst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrate worst-case upper bounds on the absolute loss for the perceptron algorithm and an exponentiated update algorithm related to the Weighted Majority algorithm. The bounds characterize the behavior of the algorithms over any sequence of trials, where each trial consists of an example and a desired o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2019
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2019.0100344