Sciweavers

    COMBINATORICS
    2000
    78views more  COMBINATORICS 2000»
    Two New Extensions of the Hales-Jewett Theorem
    13 years 11 months ago
    Two New Extensions of the Hales-Jewett Theorem
    Download  www.combinatorics.org
    : We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
    Randall McCutcheon
    claim paper
    Read More »
    SODA
    2008
    ACM
    75views Algorithms» more  SODA 2008»
    Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
    14 years 29 days ago
    Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
    Download  people.commerce.ubc.ca
    Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
    S. Thomas McCormick, Satoru Fujishige
    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.