arXiv (All)
open access
Satisfiability and freezing in random integer programs
We study a model of a random centrally symmetric polytope and ask about the existence of points in the polytope with non-zero, integer coordinates. Our main results are the location of a sharp threshold for the existence of these integer points, a characterization of the typical empirical distributi
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
- New Bounds on the Competitive Ratio of Longest Queue Drop: 1.46929591 <= CR(LQD) <= 1.683652#1013758
- Some sufficient conditions for laws of large numbers in random linear programs#69556
- Sharp detection thresholds for random geometric graphs with polynomial average degrees#1218252
- Entropy and singularity of spectral and pivotal sets in planar percolation#1109407
- The Most Informative Bit and Beyond: A Proof of the Courtade--Kumar Conjecture and Multibit Extensions#1062336
Record · ID 1324686
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