2694 search results - page 207 / 539 » Frege's New Science |
156
click to vote
ACSC
2008
IEEE
16 years 1 months ago
2008
IEEE
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
157
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
155
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
157
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
148
click to vote
FOCS
2007
IEEE
16 years 29 days 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...