Sciweavers

    6 search results - page 2 / 2
    » Inapproximability of Hypergraph Vertex Cover and Application...
    Sort
    View
    TAMC
    2007
    Springer
    114views Applied Computing» more  TAMC 2007»
    Kernelizations for Parameterized Counting Problems
    14 years 11 days ago
    Kernelizations for Parameterized Counting Problems
    Download  www.eecs.berkeley.edu
    Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
    Marc Thurley
    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.