Skip to content

Commit 7bee3ba

Browse files
GiggleLiuclaude
andcommitted
Add topology scripts guidance to README Contributing section
Help contributors prioritize rules that connect isolated problems or complete NP-hardness proof chains from 3-SAT. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
1 parent c309d42 commit 7bee3ba

1 file changed

Lines changed: 2 additions & 0 deletions

File tree

README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -69,6 +69,8 @@ See the [MCP documentation](https://codingthrust.github.io/problem-reductions/mc
6969
2. **We implement it** — for reasonable requests, maintainers tag the issue `implement` and AI agents generate a tested implementation.
7070
3. **We present it to you** — all issue contributors are invited to community calls (via [Zulip](https://problem-reductions.zulipchat.com/)), where maintainers walk through the implementation — documentation, CLI behavior, correctness — and you provide feedback.
7171

72+
**Which rules matter most?** Run `cargo run --example detect_isolated_problems` and `cargo run --example detect_unreachable_from_3sat` to see which problems are disconnected or lack NP-hardness proof chains from 3-SAT. Rules that connect isolated problems or complete proof chains are especially valuable.
73+
7274
**Authorship:** contribute 10 non-trivial reduction rules and you'll be added to the author list of the [paper](https://codingthrust.github.io/problem-reductions/reductions.pdf).
7375

7476
> **Tip:** If you use Claude Code / OpenCode / Codex, you can file issues interactively:

0 commit comments

Comments
 (0)