Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPML
2006
73views more  APPML 2006»
10 years 12 months ago
Threshold arrangements and the knapsack problem
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
Günter Rote, André Schulz
DCG
2010
57views more  DCG 2010»
10 years 12 months ago
Iterated Point-Line Configurations Grow Doubly-Exponentially
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and ...
Joshua Cooper, Mark Walters
DCC
2010
IEEE
10 years 12 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
CORR
2008
Springer
88views Education» more  CORR 2008»
10 years 12 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
CORR
2010
Springer
158views Education» more  CORR 2010»
10 years 12 months ago
Unifying the Landscape of Cell-Probe Lower Bounds
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
Mihai Patrascu
CORR
2008
Springer
125views Education» more  CORR 2008»
10 years 12 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
CORR
2008
Springer
101views Education» more  CORR 2008»
10 years 12 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
CORR
2010
Springer
135views Education» more  CORR 2010»
10 years 12 months ago
Balanced distribution-energy inequalities and related entropy bounds
Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...
Michel Rumin
CORR
2008
Springer
114views Education» more  CORR 2008»
10 years 12 months ago
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
Arkadev Chattopadhyay, Anil Ada
CORR
2010
Springer
47views Education» more  CORR 2010»
10 years 12 months ago
Lower bounds for the error decay incurred by coarse quantization schemes
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
Felix Krahmer, Rachel Ward
books