z-logo
open-access-imgOpen Access
Efficient algorithms for constraint description problems over finite totally ordered domains: Extended abstract
Author(s) -
Ángel J. Gil,
Miki Hermann,
Gernot Salzer,
Bruno Zanuttini
Publication year - 2004
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - constraint satisfaction problem , set (abstract data type) , domain (mathematical analysis) , polynomial , mathematics , constraint (computer aided design) , algorithm , finite set , constraint satisfaction , algebra over a field , algebraic number , computer science , pure mathematics , artificial intelligence , programming language , geometry , mathematical analysis , probabilistic logic

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom