1511 search results - page 3 / 303 » Randomness, lowness and degrees |
COCO
2010
Springer
15 years 3 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
RSA
2006
14 years 11 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
101
click to vote
JSAC
2011
14 years 6 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
141
click to vote
AML
2011
14 years 6 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
STOC
2006
ACM
16 years 9 hour ago
2006
ACM