168 search results - page 27 / 34 » On Nontrivial Approximation of CSPs |
84
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
It is well-known that the eigenvalue spectrum of the Laplacian matrix of a network contains valuable information about the network structure and the behavior of many dynamical proc...
DC
2010
14 years 9 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
ECCC
2007
14 years 9 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...
IJBC
2007
14 years 9 months ago
2007
The parameter dependence of the various attractive solutions of the three variable nonlinear Lorenz model equations for thermal convection in Rayleigh-B´enard flow is studied. I...
TAMC
2010
Springer
14 years 8 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...