ISTA Publications
metadata only
On the average-case hardness of total search problems
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
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- A proof of Ross's conjecture for two-site moving-target search#926160
- Consistent Path Selection for Bi-objective Median Location Problems on Graphs#625121
- Consistent Path Selection for Bi-objective Median Location Problems on Graphs#622848
- Extension of Excess Demand Ascending Auction to Multi-Demand Model by Discrete Convex Analysis Approach#971798
Record · ID 449036
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