787 search results - page 65 / 158 » Polynomial Constants are Decidable |
112
click to vote
JCO
2006
14 years 11 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
ECCC
2007
14 years 11 months ago
2007
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...