v0.1.1

ProblemReductions v0.1.1

Diff since v0.1.0

Merged pull requests:

• New Reduction: SAT to Circuit SAT (#89) (@SciCodePhy)
• Ising machines document (#93) (@c-allergic)
• Factoring documentation (#94) (@c-allergic)
• Coloring document (#95) (@c-allergic)
• Maxcut doctument (#96) (@c-allergic)
• Set Covering document (#97) (@c-allergic)
• Independent Set Document (#98) (@SciCodePhy)
• Fix the Typo of Spin Glass Documentation; Dominating Set Documentation (#99) (@SciCodePhy)
• Set Packing Documentation (#100) (@SciCodePhy)
• QUBO Documentation (#101) (@SciCodePhy)
• SAT documentation (#102) (@SciCodePhy)
• Vertex Covering Documentation (#103) (@SciCodePhy)
• Documentation: Independent Set -> Set Packing (#104) (@SciCodePhy)
• Documentation: Update "Problem Reduction Rules" (#105) (@SciCodePhy)
• Refactor (#106) (@GiggleLiu)
• Bump codecov/codecov-action from 4 to 5 (#109) (@dependabot[bot])
• Merge API reduceto (#110) (@GiggleLiu)
• Refactor grid graph (#112) (@GiggleLiu)

Closed issues:

• Write an example to show how to use this package (#8)
• Reduce 3-SAT to CircuitSAT (#10)
• Write documentation (#73)
• Write a blog (#74)
• Decision: how to measure the size of a problem (#86)