Hal Sciencemetadata only
Efficient algorithms for constraint description problems over finite totally ordered domains: Extended abstract
[info.info-ai]computer science [cs]/artificial intelligence [cs.ai]
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 629680
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.