scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors restate the minimum committee problem in terms of integer linear programming and define two m × T incidence matrices A and B according to the rule that the system is consistent if and only if T = 1; unless T < 2 m.
Abstract: is called a committee solution with q elements of system (1) (or a committee) [1]. Minimum committee (MC) problem. Given a set X and subsets D 1 , D 2 , ..., D m ≠ , find a committee solution to system (1) with the least possible q (or show that the system has no committee solutions). Following [2], it is convenient to restate the MC problem in terms of integer linear programming. Let J 1 , J 2 , ..., J T be the index set of all maximal (under inclusion) consistent subsystems (MCSs) of system (1). Obviously, the system is consistent if and only if T = 1; otherwise, 1 < T < 2 m . Define two m × T incidence matrices A and B according to the rule

9 citations

Journal ArticleDOI
TL;DR: The complexity of optimization of continuous univariate functions using a fixed number of sequentially selected function evaluations is studied in the average case under a conditioned Wiener measure and it is shown that to obtain an error of at most e, on the order of loglog(1/e) log(1/) function evaluations are required.

9 citations

Journal ArticleDOI
TL;DR: The theory of the r.
Abstract: The theory of the re m-degrees has the same computational complexity as true arithmetic In fact, it is possible to define without parameters a standard model of arithmetic in this degree structure

9 citations

Proceedings ArticleDOI
28 Mar 2013
TL;DR: A constrained two-bit transform (C2BT) for low complexity motion estimation (ME) is proposed, exploiting the advantages of the typical constrained one-bittransform (C1BT) and the typical 2BT, which significantly reduces the computational complexity of transformation of image frames into two- bit representations.
Abstract: In transforming the original image frames into two-bit representations, the typical two-bit transform (2BT) needs to calculate the variances of the local blocks. This calculation of variances inevitably involves multiplication operations and renders the computational complexity of typical 2BT somewhat high. In this paper, we propose a constrained two-bit transform (C2BT) for low complexity motion estimation (ME). By exploiting the advantages of the typical constrained one-bit transform (C1BT) and the typical 2BT, the proposed algorithm significantly reduces the computational complexity of transformation of image frames into two-bit representations. Experimental results show that the proposed algorithm enhances the ME accuracy by 0.35dB and 0.28dB compared with the 2BT-based ME and the C1BT-based ME, respectively.

9 citations

Proceedings ArticleDOI
29 Nov 2004
TL;DR: A high performance algorithm, dual iterative all hops k-shortest paths (DIAHKP) algorithm, that can achieve 100% success ratio in finding the delay constrained least cost (DCLC) path with very low average computational complexity.
Abstract: We introduce an iterative all hops k-shortest paths (IAHKP) algorithm that is capable of iteratively computing all hops k-shortest path (AHKP) from a source to a destination. Based on IAHKP, a high performance algorithm, dual iterative all hops k-shortest paths (DIAHKP) algorithm, is proposed. It can achieve 100% success ratio in finding the delay constrained least cost (DCLC) path with very low average computational complexity. The underlying concept is that since DIAHKP is a k-shortest-paths-based solution to DCLC, implying that its computational complexity increases with k, we can minimize its computational complexity by adaptively minimizing k, while achieving 100% success ratio in finding the optimal feasible path. Through extensive analysis and simulations, we show that DIAHKP is highly effective and flexible. By setting a very small upper bound to k (k=1,2), DIAHKP still can achieve very satisfactory performance. With only an average computational complexity of twice that of the standard Bellman-Ford algorithm, DIAHKP achieves 100% success ratio in finding the optimal feasible path in the typical 32-node network.

9 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
89% related
Approximation algorithm
23.9K papers, 654.3K citations
87% related
Data structure
28.1K papers, 608.6K citations
83% related
Upper and lower bounds
56.9K papers, 1.1M citations
83% related
Computational complexity theory
30.8K papers, 711.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
20216
202010
20199
201810
201732