2200 search results - page 125 / 440 » Bloch's Constant is Computable |
208
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
We study the problem of the reconstruction of a Gaussian field defined in [0, 1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate require...
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
165
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
157
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
164
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...