A P-complete language describable with iterated shuffle
Authors:
Takayoshi Shoudai
Affiliations:
-
Venue:
Information Processing Letters
Year:
1992
Citing
0
Cited
1
Unshuffling a square is NP-hard
Journal of Computer and System Sciences
Quantified Score
Hi-index
0.89
Visualization
Abstract