53 search results - page 2 / 11 » Regularity Lemmas and Combinatorial Algorithms |
94
Voted
COCO
2010
Springer
15 years 3 months ago
2010
Springer
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 ...
94
Voted
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
DAM
2007
14 years 11 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
116
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...