1552 search results - page 55 / 311 » On the Complexity of Constant Propagation |
191
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
189
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
163
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
165
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
140
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...