Search Sciweavers | Sciweavers

14

FOCS
2009
IEEE

121views Theoretical Computer Science» more FOCS 2009»

Regularity Lemmas and Combinatorial Algorithms

13 years 11 months ago

— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the ﬁrst asymptotic impro...

Nikhil Bansal, Ryan Williams

claim paper

Read More »

15

click to vote

CORR
2008
Springer

108views Education» more CORR 2008»

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning

13 years 4 months ago

Download www.math.ucsd.edu

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...

Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen

claim paper

Read More »

15

click to vote

COCO
2010
Springer

144views Algorithms» more COCO 2010»

A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions

13 years 8 months ago

Download www1.cs.columbia.edu

We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...

Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...

claim paper

Read More »

14

click to vote

RSA
2006

113views more RSA 2006»

Applications of the regularity lemma for uniform hypergraphs

13 years 4 months ago

Download www.mathcs.emory.edu

In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...

Vojtech Rödl, Jozef Skokan

claim paper

Read More »

15

click to vote

RSA
2006

115views more RSA 2006»

The counting lemma for regular k-uniform hypergraphs

13 years 4 months ago

Download www.math.uni-hamburg.de

Brendan Nagle, Vojtech Rödl, Mathias Schacht

claim paper