Sciweavers

    IPL
    2011
    112views more  IPL 2011»
    Improved approximation algorithms for minimum AND-circuits problem via k-set cover
    13 years 6 months ago
    Improved approximation algorithms for minimum AND-circuits problem via k-set cover
    Download  www.cis.shimane-u.ac.jp
    Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
    Hiroki Morizumi
    claim paper
    Read More »
    DAGSTUHL
    2006
    122views Software Engineering» more  DAGSTUHL 2006»
    Approximability of Minimum AND-Circuits
    14 years 26 days ago
    Approximability of Minimum AND-Circuits
    Download  www.stat.berkeley.edu
    Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
    Jan Arpe, Bodo Manthey
    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.