42,636 research outputs found
The Complexity of Scheduling for p-norms of Flow and Stretch
We consider computing optimal k-norm preemptive schedules of jobs that arrive
over time. In particular, we show that computing the optimal k-norm of flow
schedule, is strongly NP-hard for k in (0, 1) and integers k in (1, infinity).
Further we show that computing the optimal k-norm of stretch schedule, is
strongly NP-hard for k in (0, 1) and integers k in (1, infinity).Comment: Conference version accepted to IPCO 201
Arithmetic complexity via effective names for random sequences
We investigate enumerability properties for classes of sets which permit
recursive, lexicographically increasing approximations, or left-r.e. sets. In
addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably,
Schnorr, and Kurtz random sets, weakly 1-generics and their complementary
classes, we find that there exist characterizations of the third and fourth
levels of the arithmetic hierarchy purely in terms of these notions.
More generally, there exists an equivalence between arithmetic complexity and
existence of numberings for classes of left-r.e. sets with shift-persistent
elements. While some classes (such as Martin-L\"{o}f randoms and Kurtz
non-randoms) have left-r.e. numberings, there is no canonical, or acceptable,
left-r.e. numbering for any class of left-r.e. randoms.
Finally, we note some fundamental differences between left-r.e. numberings
for sets and reals
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
We study the complexity of computing the mixed-integer hull
of a polyhedron .
Given an inequality description, with one integer variable, the mixed-integer
hull can have exponentially many vertices and facets in . For fixed,
we give an algorithm to find the mixed integer hull in polynomial time. Given
and fixed, we compute a vertex description of
the mixed-integer hull in polynomial time and give bounds on the number of
vertices of the mixed integer hull
A note on the gap between rank and border rank
We study the tensor rank of the tensor corresponding to the algebra of
n-variate complex polynomials modulo the dth power of each variable. As a
result we find a sequence of tensors with a large gap between rank and border
rank, and thus a counterexample to a conjecture of Rhodes. At the same time we
obtain a new lower bound on the tensor rank of tensor powers of the generalised
W-state tensor. In addition, we exactly determine the tensor rank of the tensor
cube of the three-party W-state tensor, thus answering a question of Chen et
al.Comment: To appear in Linear Algebra and its Application
Almost Linear Complexity Methods for Delay-Doppler Channel Estimation
A fundamental task in wireless communication is channel estimation: Compute
the channel parameters a signal undergoes while traveling from a transmitter to
a receiver. In the case of delay-Doppler channel, i.e., a signal undergoes only
delay and Doppler shifts, a widely used method to compute delay-Doppler
parameters is the pseudo-random method. It uses a pseudo-random sequence of
length N; and, in case of non-trivial relative velocity between transmitter and
receiver, its computational complexity is O(N^2logN) arithmetic operations. In
[1] the flag method was introduced to provide a faster algorithm for
delay-Doppler channel estimation. It uses specially designed flag sequences and
its complexity is O(rNlogN) for channels of sparsity r. In these notes, we
introduce the incidence and cross methods for channel estimation. They use
triple-chirp and double-chirp sequences of length N, correspondingly. These
sequences are closely related to chirp sequences widely used in radar systems.
The arithmetic complexity of the incidence and cross methods is O(NlogN + r^3),
and O(NlogN + r^2), respectively.Comment: 4 double column pages. arXiv admin note: substantial text overlap
with arXiv:1309.372
Myopic Models of Population Dynamics on Infinite Networks
Reaction-diffusion equations are treated on infinite networks using semigroup
methods. To blend high fidelity local analysis with coarse remote modeling,
initial data and solutions come from a uniformly closed algebra generated by
functions which are flat at infinity. The algebra is associated with a
compactification of the network which facilitates the description of spatial
asymptotics. Diffusive effects disappear at infinity, greatly simplifying the
remote dynamics. Accelerated diffusion models with conventional eigenfunctions
expansions are constructed to provide opportunities for finite dimensional
approximation.Comment: 36 pages. arXiv admin note: text overlap with arXiv:1109.313
On the expected number of equilibria in a multi-player multi-strategy evolutionary game
In this paper, we analyze the mean number of internal equilibria in
a general -player -strategy evolutionary game where the agents' payoffs
are normally distributed. First, we give a computationally implementable
formula for the general case. Next we characterize the asymptotic behavior of
, estimating its lower and upper bounds as increases. Two important
consequences are obtained from this analysis. On the one hand, we show that in
both cases the probability of seeing the maximal possible number of equilibria
tends to zero when or respectively goes to infinity. On the other hand,
we demonstrate that the expected number of stable equilibria is bounded within
a certain interval. Finally, for larger and , numerical results are
provided and discussed.Comment: 26 pages, 1 figure, 1 table. revised versio
- …