33 search results - page 2 / 7 » An Algorithmic Hypergraph Regularity Lemma |
STOC
2009
ACM
13 years 12 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
JCT
2011
13 years 4 days ago
2011
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
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...