HAL Science
metadata only
Efficient algorithms for constraint description problems over finite totally ordered domains: Extended abstract
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient algorithms for description problems over finite totally ordered domains#629681
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
- A knowledge-based iterated local search for the weighted total domination problem#231605
- Multilevel iterated tabu search for the multi-constraint graph partitioning problem#231626
- High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing#238577
Record · ID 629680
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive