arXiv (All)
open access
On the Support Geometry and Complexity of LABS
LABS are a fundamental combinatorial optimization problem arising in sequence design and statistical physics, yet the formal complexity of the standard fixed-geometry problem remains unresolved. We study how zero-energy complexity changes when support geometry is included as part of the input and th
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
- Scientific discovery as meta-optimization: a combinatorial optimization case study#1389331
- Avoiding reification: Heuristic effectiveness of mathematics and the prediction of the omega minus particle#736474
- Solving or approximating recurrence relations for sequences of numbers#796544
- Width-Bounded Equational Derivations for Finite Graph Expressions#985689
- 1000 Solved Problems in Classical Physics#1316485
Record · ID 1402717
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