Old Web
English
Sign In
Acemap
>
Paper
>
Pearl Puzzles are NP-complete
Pearl Puzzles are NP-complete
2002
Erich Friedman
Keywords:
Combinatorics
NP-complete
Mathematics
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
11
References
9
Citations
NaN
KQI
[]