258 search results - page 17 / 52 » New Lower Bounds for Heilbronn Numbers |
JACM
2006
13 years 7 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
CONSTRAINTS
2008
13 years 7 months ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...