14 search results - page 2 / 3 » Co-degree density of hypergraphs |
RSA
2008
13 years 4 months ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
APAL
2010
13 years 5 months ago
2010
The characteristic sequence of hypergraphs Pn : n < associated to a formula (x; y), introduced in [5], is defined by Pn(y1, . . . yn) = (x) in (x; yi). We continue the study o...
DM
2008
13 years 5 months ago
2008
A family F of k-graphs is called non-principal if its Tur
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...