DataCite
metadata only
CC BY 4.0
An Empirical Analysis of the B-Tree Navigator Algorithm: Solving the Subset Sum Problem in Polynomial-Average Time
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
- An Empirical Analysis of the B-Tree Navigator Algorithm: Solving the Subset Sum Problem in Polynomial-Average Time#28916
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers#178911
- Filter Learning for Subgraphs: Algebras and Performance Risk Bounds#394421
- Improved Efficient Subwindow Search software#444525
Record · ID 28917
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