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
TL;DR: The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula.
Abstract: The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula. We obtain new asymptotic results on the average case and worst case complexity of this algorithm as the underlying shape tends to a fixed limit curve. Furthermore, using the summation package Sigma we prove an exact formula for the average case complexity when the underlying shape consists of only two rows. We thereby answer questions posed by Krattenthaler and Muller.
4 citations
TL;DR: A direct proof of a polynomial complexity algorithm for a certain class of multiple user detection problems is given.
Abstract: A direct proof of a polynomial complexity algorithm for a certain class of multiple user detection problems is given. Properties of signature signal matrices leading to the polynomial complexity algorithm are identified.
4 citations
24 Feb 2017
TL;DR: This paper proposes a methodology based on system connections to calculate its complexity, modeled using the theory of Discrete Event Systems to solve the dining Chinese philosophers’ problem and the distribution center.
Abstract: This paper proposes a methodology based on system connections to calculate its complexity. Two study cases are proposed: the dining Chinese philosophers’ problem and the distribution center. Both studies are modeled using the theory of Discrete Event Systems and simulations in different contexts were performed in order to measure their complexities. The obtained results present i) the static complexity as a limiting factor for the dynamic complexity, ii) the lowest cost in terms of complexity for each unit of measure of the system performance and iii) the output sensitivity to the input parameters. The associated complexity and performance measures aggregate knowledge about the system.
4 citations
01 Jan 2004
TL;DR: This paper is an introduction to the entire volume: the notions of reduction functions and their derived complexity classes are introduced abstractly and connected to the areas covered by this volume.
Abstract: This paper is an introduction to the entire volume: the notions of reduction functions and their derived complexity classes are introduced abstractly and connected to the areas covered by this volume.
4 citations