Sciweavers

    103
    Voted
    CPC
    2000
    58views more  CPC 2000»
    Packing Ferrers Shapes
    15 years 28 days ago
    Packing Ferrers Shapes
    Download  www.cs.tau.ac.il
    Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
    Noga Alon, Miklós Bóna, Joel Spencer
    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-2026, USA.