11345 search results - page 1754 / 2269 » Foundations of Computer Science |
135
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
159
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
140
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
137
click to vote
FOCS
2007
IEEE
15 years 11 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...
152
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...