The priority model was introduced to capture "greedy-like" algorithms. Motivated by the success of advice complexity in the area of online algorithms, the fixed priority model was extended to include advice, and a reduction-based framework was develo...
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO detection...
The game-theoretical approach to non-extensive entropy measures of statistical physics is based on an abstract measure of complexity from which the entropy measure is derived in a natural way. A wide class of possible complexity measures is conside...
In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems
In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior works. Th...
The bribery problem in election has received considerable attention in the literature, upon which various algorithmic and complexity results have been obtained. It is thus natural to ask whether we can protect an election from potential bribery. We a...
While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of space-bounded quantum computation. We relate the quantum space complexity of computing a function f with...
We study classical query algorithms with post-selection, and find that they are closely connected to rational functions with nonnegative coefficients. We show that the post-selected classical query complexity of a Boolean function is equal to the min...
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of approximat...
Oct 6, 2020 · Arrange in increasing order of asymptotic complexity Ask Question Asked 5 years, 4 months ago Modified 5 years, 4 months ago
Given below, there are some good solutions to find the closed form expression, which also give the asymptotic complexity. However, if you only need the asymptotic complexity, the analysis is simpler. …
To exhibit the possible origin of the inner complexity of the Berkovits's pure spinor approach, we consider the covariant BRST quantization of the D=11 massless superparticle (M0-brane) in its spinor moving frame or twistor-like Lorentz harmonics f...
We describe a method to upper bound the quantum query complexity of Boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method can give an upper bound on query complexity without pro...
Long range communication with LoRa has become popular as it avoids the complexity of multi-hop communication at low cost and low energy consumption. LoRa is openly accessible, but its packets are particularly vulnerable to collisions due to long time...
Every nation prioritizes the inclusive economic growth and development of all regions. However, we observe that economic activities are clustered in space, which results in a disparity in per-capita income among different regions. A complexity-based...
In this paper, we investigate the computational complexity of solutions to the Laplace and the diffusion equation. We show that for a certain class of initial-boundary value problems of the Laplace and the diffusion equation, the solution operator is...
In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial order lea...
We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the state compl...
We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that ${\mathcal{NP}}...