SAT problems with chains of dependent variables
From MaRDI portal
Publication:1408386
DOI10.1016/S0166-218X(02)00410-9zbMath1029.68083MaRDI QIDQ1408386
Publication date: 15 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (4)
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem ⋮ An incremental SAT-based approach for solving the real-time taxi-sharing service problem ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings ⋮ Chinese remainder encoding for Hamiltonian cycles
Uses Software
Cites Work
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Coloration neighbourhood search with forward checking
- Experimental results on the crossover point in random 3-SAT
- SATO: An efficient propositional prover
- A machine program for theorem-proving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: SAT problems with chains of dependent variables