2200 search results - page 137 / 440 » Bloch's Constant is Computable |
170
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
176
click to vote
JUCS
2010
15 years 4 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
166
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
176
click to vote
IMCSIT
2010
15 years 3 months ago
2010
The aim of this paper is to show that a special kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving a tridiagona...
163
click to vote
FOCS
2007
IEEE
16 years 24 days 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...