Sciweavers

787 search results - page 65 / 158
» Polynomial Constants are Decidable
Sort
View
JCO
2006
126views more  JCO 2006»
13 years 8 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
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 ...
Yu Wang 0003, Xiang-Yang Li
ECCC
2007
71views more  ECCC 2007»
13 years 8 months ago
Inverse Conjecture for the Gowers norm is false
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...
Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 6 months ago
Secure Multiparty Computation with Partial Fairness
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...
Amos Beimel, Eran Omri, Ilan Orlov
CSR
2007
Springer
14 years 2 months ago
New Bounds for MAX-SAT by Clause Learning
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...
Alexander S. Kulikov, Konstantin Kutzkov
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 1 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
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...
Uriel Feige, Eran Ofek