FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
123
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
109
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
115
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
120
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
