The following pages link to (Q4230728):
Displaying 12 items.
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem (Q3067705) (← links)
- Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One (Q4632185) (← links)
- Construction of maximally non-Hamiltonian graphs (Q4809625) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Frozen development in graph coloring (Q5958809) (← links)
