Solvability of Peg Solitaire on Graphs is NP-Complete
['Kazushi ITO', 'Yasuhiko TAKENAGA']
/
IEICE Transactions on Information and Systems
/ Vol. 106
/ No. 6
0.0 / 5
0
Reviews
You must log in to post, edit and delete a review.
Log in
Earn 50 points when your review is published.
About KnowledgeRank Points
No reviews have been posted yet. Be the first to write one!