2200 search results - page 89 / 440 » Bloch's Constant is Computable |
136
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
187
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
174
click to vote
PODC
1999
ACM
15 years 10 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
153
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
155
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...