Sciweavers

    1 search results - page 1 / 1
    » dmtcs 2011
    Sort
    View
    212
    Voted
    DMTCS
    2011
    261views Mathematics» more  DMTCS 2011»
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    14 years 2 months ago
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    Download  www.math.uni-hamburg.de
    Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
    Yury Person, Mathias Schacht
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.