2095 search results - page 59 / 419 » Improved pebbling bounds |
STOC
2005
ACM
14 years 10 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
IWDW
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Many coded digital watermarking systems development requires first the selection of a (uncoded) modulation technique to be part of a coded architecture. Therefore, perfo...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
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...