Sciweavers

    53 search results - page 1 / 11
    » Regularity Lemmas and Combinatorial Algorithms
    Sort
    View
    FOCS
    2009
    IEEE
    121views Theoretical Computer Science» more  FOCS 2009»
    Regularity Lemmas and Combinatorial Algorithms
    13 years 11 months ago
    Regularity Lemmas and Combinatorial Algorithms
    Download  www.cs.cmu.edu
    — 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...
    Nikhil Bansal, Ryan Williams
    claim paper
    Read More »
    STOC
    2006
    ACM
    168views Algorithms» more  STOC 2006»
    A combinatorial characterization of the testable graph properties: it's all about regularity
    14 years 5 months ago
    A combinatorial characterization of the testable graph properties: it's all about regularity
    Download  www.math.tau.ac.il
    A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
    Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
    claim paper
    Read More »
    DCG
    2008
    118views more  DCG 2008»
    General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
    13 years 5 months ago
    General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
    Download  www.cs.berkeley.edu
    Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
    Jonathan Richard Shewchuk
    claim paper
    Read More »
    RSA
    2006
    113views more  RSA 2006»
    Applications of the regularity lemma for uniform hypergraphs
    13 years 5 months ago
    Applications of the regularity lemma for uniform hypergraphs
    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 »
    CORR
    2008
    Springer
    108views Education» more  CORR 2008»
    Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
    13 years 5 months ago
    Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
    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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.