Topic
Average-case complexity
About: Average-case complexity is a research topic. Over the lifetime, 1749 publications have been published within this topic receiving 44972 citations.
Papers published on a yearly basis
Papers
More filters
Journal Article•
TL;DR: In most cases, the complete counting functions on the 6-error linear complexity of 2n-periodic binary sequences are presented and an important error in the bibliography is pointed out.
Abstract: The linear complexity and the k-error linear complexity of a sequence have been used as important measures of keystream sequence strength.By studying linear complexity of binary sequences with period 2n,based on Games-Chan algorithm,6-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n-1 is discussed.In most cases,the complete counting functions on the 6-error linear complexity of 2n-periodic binary sequences are presented.As a consequence of these results,an important error in the bibliography is pointed out.
2 citations
12 Oct 1987
TL;DR: This work analyses the average case performance of a simple backtracking algorithm for determining all exact-satisfying truth assignments of boolean formulas in conjunctive normal form with r clauses over n variables and shows that the average number of nodes in the backtracking trees of formulas from these classes is bounded by a constant.
Abstract: We analyse the average case performance of a simple backtracking algorithm for determining all exact-satisfying truth assignments of boolean formulas in conjunctive normal form with r clauses over n variables. A truth assignment exact-satisfies a formula, if in each clause exactly one literal is set to true. We show: If formulas are chosen by generating clauses independently, where each variable occurs in a clause either unnegated with probability p or negated with probability q or none of both with probability 1-p-q (p,q>0, p+q≦1), then the average number of nodes in the backtracking trees of formulas from these classes is bounded by a constant, for all neN, if r≧1n2/(pq) is chosen. (In case of p=q=1/3 the result holds for all r≧6.)
2 citations
TL;DR: This paper studies critically six shortest-path algorithms which are considered to be highly efficient and elegant, and presents a comparison of their computational complexity, simplicity, accessibility, applicability, capacity and speed.
Abstract: Built into several heuristics available for the topological design of computer networks, and inherent in the multicommodity nature of flow, is the determination of the shortest paths between pairs of nodes. Owing to the repeated requirement for shortest-path analyses during the course of optimization, the computational complexity of the heuristics depends upon the computational complexity of the shortest-path problem. This paper studies critically six shortest-path algorithms which are considered to be highly efficient and elegant, and presents a comparison of their computational complexity, simplicity, accessibility, applicability, capacity and speed.
2 citations
06 Jul 2015
TL;DR: A new approach is presented called L* which improves the A* graph searching algorithm and provides linear computational complexity due to the lack of the open list sorting procedure, which is a crucial factor in order to decrease the time consumption for large open list sizes in a graph searching algorithms.
Abstract: The A* algorithm and its modifications are commonly used in graph searching for mobile robot path planning. However in case of large open list sizes the A* algorithm needs significant time to find the solution due to the open list sorting procedure which determines the computational complexity of A*. This paper presents a new approach called L* which improves the A* graph searching algorithm and provides linear computational complexity due to the lack of the open list sorting procedure. This is a crucial factor in order to decrease the time consumption for large open list sizes in a graph searching algorithm.
2 citations
IBM1
TL;DR: The object of this note is to give a correct proof of Proposition, 5.2.2 of [ 11], a function that assigns to every positive integer d a non-negative real number C(d) and satisfies the following three axioms.
2 citations