Stop the war!
Остановите войну!
for scientists:
default search action
"Solvability of Peg Solitaire on Graphs is NP-Complete."
Kazushi Ito, Yasuhiko Takenaga (2023)
- Kazushi Ito, Yasuhiko Takenaga:
Solvability of Peg Solitaire on Graphs is NP-Complete. IEICE Trans. Inf. Syst. 106(6): 1111-1116 (2023)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.