1511 search results - page 15 / 303 » Randomness, lowness and degrees |
90
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
MSCS
2006
15 years 1 months ago
2006
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
119
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
98
Voted
IJCAI
2001
15 years 3 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
120
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...