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 Jan 1997
TL;DR: The final author version and the galley proof are versions of the publication after peer review and the final published version features the final layout of the paper including the volume, issue and page numbers.
Abstract: • A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
23 citations
TL;DR: This work establishes tight bounds for the transition complexity of Boolean operations, in the case of union the upper and lower bounds differ by a multiplicative constant two, and shows that the transition simplicity results for union and complementation are very different from the state complexity results for the same operations.
Abstract: We consider the transition complexity of regular languages based on the incomplete deterministic finite automata. We establish tight bounds for the transition complexity of Boolean operations, in the case of union the upper and lower bounds differ by a multiplicative constant two. We show that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity bounds turn out to be similar to the corresponding bounds for state complexity.
23 citations
TL;DR: A first-order and a high-order algorithm for solving linear complementarity problems, both of which are implicitly associated with a large neighborhood whose size may depend on the dimension of the problems, are studied.
Abstract: In this paper we study a first-order and a high-order algorithm for solving linear complementarity problems These algorithms are implicitly associated with a large neighborhood whose size may depend on the dimension of the problems The complexity of these algorithms depends on the size of the neighborhood For the first-order algorithm, we achieve the complexity bound which the typical large-step algorithms possess It is well known that the complexity of large-step algorithms is greater than that of short-step ones By using high-order power series (hence the name high-order algorithm), the iteration complexity can be reduced We show that the complexity upper bound for our high-order algorithms is equal to that for short-step algorithms
23 citations
01 Jan 2005
TL;DR: A scheme that generates low jitter schedules with low computational complexity with an integer decomposition of the rate-matrix, similar to the Birkhoff-von Neumann decomposition is presented.
Abstract: A smooth scheduling with guaranteed rate service and bounded packet delay is a desired objective of any switch scheduling algorithm. We present a scheme that generates low jitter schedules with low computational complexity. The scheduler uses an integer decomposition of the rate-matrix, similar to the Birkhoff-von Neumann decomposition. It improves the delay and jitter performance of the smooth scheduler as described in Keslassy et al. with an increase in the number of permutation matrices that the switch fabric has to cycle through. This increase is shown to be a constant for all practical purposes. Two algorithms are presented that have time complexity O(n/sup 2/ + log n) and space complexity O(n/sup 2/) and O(n) respectively. An existing scheduling algorithm for single links, smoothed round robin, is employed for scheduling the permutation matrices. This algorithm has a computational complexity overhead of O(1) and ensures smooth scheduling.
23 citations
Posted Content•
TL;DR: This work develops theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion and defines counterparts of the complexity classes P/ poly and NP/poly and forms a counterpart to the complexity theoretic conjecture that NP is not included in P/poly.
Abstract: We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and NP/poly and formulate a counterpart of the complexity theoretic conjecture that NP is not included in P/poly. In addition, we define a notion of completeness for the counterpart of NP/poly using a non-uniform reducibility relation and formulate complexity hypotheses which concern restrictions on the instruction sequences used for computation. We think that the theory developed opens up an additional way of investigating issues concerning non-uniform complexity.
23 citations