36 search results - page 6 / 8 » Theorems on Efficient Argument Reductions |
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
TSP
2010
13 years 2 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
IJNSEC
2010
13 years 2 months ago
2010
This paper proposes a scheme to provide security to dynamic multicast VoIP systems efficiently. Security is usually provided by encrypting the media packets sent from a user to ot...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...