63 search results - page 10 / 13 » Two-coloring Random Hypergraphs |
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
ICS
2010
Tsinghua U.
15 years 1 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
78
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
TOC
2008
14 years 9 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...