Sciweavers

    CADE
    2004
    Springer
    114views Logical Reasoning» more  CADE 2004»

    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract

    14 years 11 months ago
    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract
    Download  users.info.unicaen.fr
    Àngel J. Gil, Bruno Zanuttini, Gernot Salze
    claim paper
    Added 03 Dec 2009
    Updated 03 Dec 2009
    Type Conference
    Year 2004
    Where CADE
    Authors Àngel J. Gil, Bruno Zanuttini, Gernot Salzer, Miki Hermann
    Comments (0)
    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.