arXiv (All)
open access
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
Efficiently determining the satisfiability of a boolean equation -- known as the SAT problem for brevity -- is crucial in various industrial problems. Recently, the advent of deep learning methods has introduced significant potential for enhancing SAT solving. However, a major barrier to the advance
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
- Verifiable Sampling for Delegated Generative Quantum Machine Learning#1297563
- Quantum-enhanced deep learning models for automated defect detection in materials.#645550
- Solving In-Table Prediction Problems by Deep Neural Networks with Performance Evaluation Using Synthetic Data#821216
- Revisiting Simple Baselines for Relational Deep Learning#1355452
- Revisiting Simple Baselines for Relational Deep Learning#1335984
Record · ID 1201841
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