HAL (France)
open access
Faster algorithms for approximating combinatorial and geometric data
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
- Learning Random Geometric Graphs Drawn in Probabilistic Metric Spaces#467120
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Geometric statistical inference#639100
- Probabilistic Methods in Combinatorics#67362
- Computational Dynamics of Natural Information Morphology, Discretely Continuous#720621
Record · ID 213219
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