Sciweavers

    132
    Voted
    CSR
    2009
    Springer
    121views Theoretical Computer Science» more  CSR 2009»
    On Random Ordering Constraints
    15 years 10 months ago
    On Random Ordering Constraints
    Download  www.tu-chemnitz.de
    Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
    Andreas Goerdt
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.