HAL Science
metadata only
Efficient algorithms for description problems over finite totally ordered domains
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 constraint description problems over finite totally ordered domains: Extended abstract#629680
- More Capable, Less Faithful: A Multilingual Analysis of Mathematical (Un)Solvability Detection in LLMs#799664
- Structure over Pixels: Learning Variable-Length Visual Programs#1144816
- CRISP: Compositional Relations as Invariant Structural Priors for Domain Generalization#1063906
- Default-Distance Entropy and Metric Dimension in Finite Geometries#781079
Record · ID 629681
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