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
26 Dec 2007
TL;DR: In this article, the structure of the Wei-Xiao-Chen algorithm was optimized for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2).
Abstract: We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.
5 citations
10 Jun 1994
TL;DR: This paper searches for connections between descriptional and computational complexities of infinite words, measuring the complexity of the mechanism used to generate infinite words by resourses used by Turing machines.
Abstract: This paper searches for connections between descriptional and computational complexities of infinite words. In the former one the complexity is measured by the complexity of the mechanism used to generate infinite words, typical examples being iterated morphisms, iterated dgsm's and double D0L TAG systems. In the latter on the complexity is measured by resourses used by Turing machines to generate infinite words.
5 citations
02 Mar 1995
TL;DR: It is proved that the Instance Complexity Conjecture of Ko, Orponen, Schoning, and Watanabe for all recursive tally sets and forall recursive sets which are NP-hard under honest reductions holds for all natural NP- hard problems.
Abstract: We prove the Instance Complexity Conjecture of Ko, Orponen, Schoning, and Watanabe for all recursive tally sets and for all recursive sets which are NP-hard under honest reductions, in particular it holds for all natural NP-hard problems. On the other hand, the conjecture is shown to be oracle dependent. Additional results concern the nonrecursiveness of the instance complexity measure and a comparison of time-bounded C- and CD-complexity.
5 citations
TL;DR: In this paper, the classical query complexity for continuous problems is derived and a simple formula for a lower bound on the number of qubits used by a quantum algorithm is established in terms of the classical quantum query complexity.
Abstract: The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity.
5 citations
07 Jun 2016
TL;DR: A methodology based on system connections to calculate its complexity, modeled using the theory of discrete event systems and simulated in different contexts in order to measure their complexities is proposed.
Abstract: This paper proposes a methodology based on system connections to calculate its complexity. There are proposed two study cases: the dining Chinese philosophers problem and the distribution center. Both studies are modeled using the theory of discrete event systems and simulated in different contexts in order to measure their complexities. The obtained results present i) the static complexity as a limiting factor for the dynamic complexity and ii) the lowest cost in terms of complexity for each unit of measure of the system performance. The associated complexity and performance measures aggregate knowledge about the system.
5 citations