arXiv (OAI)
open access
Algorithms and hardness for Metric Dimension on digraphs
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
- DP-Splat: Bayesian Nonparametric Complexity Control for Gaussian Splatting#1052231
- MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search#134637
- Generative Similarity, Generalization, and Abstraction#171676
- Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders#1083584
- Progress in Benchmarking Generics for Mathematical Computation#411118
Record · ID 146986
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