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
01 Dec 1995
TL;DR: This paper presents a new algorithm of worst-case time (and space) complexity O(n log n), where n is the total number of realizations for the basic blocks, regardless whether the slicing is balanced or not, and proves /spl Omega/( n log n) is the lower bound and the time complexity of any area minimization algorithm.
Abstract: The traditional algorithm of L. Stockmeyer (1983) for area minimization of slicing floorplans has time (and space) complexity O(n/sup 2/) in the worst case, or O(n log n) for balanced slicing. For more than a decade, it is considered the best possible. In this paper, we present a new algorithm of worst-case time (and space) complexity O(n log n), where n is the total number of realizations for the basic blocks, regardless whether the slicing is balanced or not. We also prove /spl Omega/(n log n) is the lower bound and the time complexity of any area minimization algorithm. Therefore, the new algorithm not only finds the optimal realization, but also has an optimal running time.
7 citations
01 Jan 2012
TL;DR: This paper focuses its attention on satisfiability problems because they play a key role in the definition of both parameterized complexity and structural complexity classes, and because they model numerous important problems in computer science.
Abstract: Since its inception in the 1990's, parameterized complexity has established itself as one of the major research areas in theoretical computer science. Parameterized and kernelization algorithms have proved to be very useful for solving important problems in various domains of science and technology. Moreover, parameterized complexity has shown deep connections to traditional areas of theoretical computer science, such as structural complexity theory and approximation algorithms.
In this paper, we discuss some of the recent results pertaining to the relation between parameterized complexity and subexponential-time computability. We focus our attention on satisfiability problems because they play a key role in the definition of both parameterized complexity and structural complexity classes, and because they model numerous important problems in computer science.
7 citations
01 Jan 2001
TL;DR: A polynomial-time algorithm for scheduling tasks in AND-OR graphs with complexity O(np) is presented, which is superior to the complexity of previously known algorithms.
Abstract: We present a polynomial-time algorithm for scheduling tasks in AND-OR graphs. Given the total number p of arcs and the number n of nodes, the complexity of the algorithm is O(np), which is superior to the complexity of previously known algorithms.
7 citations
Posted Content•
TL;DR: In this paper, a new quantum algorithm for a search problem and its computational complexity are discussed, and it is shown in the search problem containing 2^n objects that their algorithm runs in polynomial time.
Abstract: A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
7 citations
02 Mar 2015
TL;DR: Computational complexity bounds for various classes of functions computed by cost register automata are given.
Abstract: We give complexity bounds for various classes of functions computed by cost register automata.
7 citations