Sciweavers

    2 search results - page 1 / 1
    » Completeness in the Boolean Hierarchy: Exact-Four-Colorabili...
    Sort
    View
    JUCS
    2006
    94views more  JUCS 2006»
    Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
    13 years 5 months ago
    Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
    Download  www.jucs.org
    : This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
    Tobias Riege, Jörg Rothe
    claim paper
    Read More »
    MST
    2006
    99views more  MST 2006»
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
    13 years 5 months ago
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
    Download  ccc.cs.uni-duesseldorf.de
    We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
    Tobias Riege, Jörg Rothe
    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.