arXiv (All)
open access
Measuring Sudoku Difficulty: Formulation, Propagation and Uniqueness Certification
Finding a Sudoku completion and proving that the completion is unique are different computational tasks. Despite both concerning the same puzzle, their computational effort need not be closely related. In this paper, we investigate how this relationship depends on the mathematical formulation, solve
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
- Tiling 3D by Translates of a Single Polycube is Undecidable#1249816
- Expanding the notion of inconsistency in mathematics: the theoretical foundations of mutual inconsistency#114796
- Artificial intelligence modeling of small molecule pharmaceutical solubility in supercritical fluid and comparative analysis under temperature and pressure variations.#1147050
- J-Type Random 2,3 Satisfiability Reverse Analysis Topological-Based Method In Discrete Hopfield Neural Network#990413
- Diagnostic assessment of artificial intelligence reconstruction on accelerated prostate MRI: a retrospective, paired, multi-reader multi-case study#348964
Record · ID 1469014
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