475 search results - page 5 / 95 » Z3-Connectivity with Independent Number 2 |
125
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
106
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
130
click to vote
ALGORITHMICA
2011
14 years 8 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
134
click to vote
SWAT
2010
Springer
15 years 6 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
105
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...