3415 search results - page 329 / 683 » Lower bounds on kernelization |
169
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
150
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
161
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
170
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
176
Voted
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...