BOOK-CHAPTER
Kaboozle Is NP-complete, Even in a Strip
Tetsuo AsanoErik D. DemaineMartin L. DemaineRyuhei Uehara
Year: 2010 Lecture notes in computer science Pages: 28-36 Publisher: Springer Science+Business Media
Keywords:
Computer science Colored Folding (DSP implementation) Enhanced Data Rates for GSM Evolution Square (algebra) Rotation (mathematics) NP-complete Order (exchange) Combinatorics Stacking Time complexity Algorithm Geometry Mathematics Artificial intelligence Physics Structural engineering
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
6
Refs
0.18
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Computational Geometry and Mesh Generation
Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design
Genome Rearrangement Algorithms
Life Sciences → Biochemistry, Genetics and Molecular Biology → Genetics
Related Documents
JOURNAL ARTICLE
NP-completeness of generalized Kaboozle
Tetsuo AsanoErik D. DemaineMartin L. DemaineRyuhei Uehara
Journal: Journal of Information Processing Year: 2012 Vol: 20 (3)Pages: 713-718
JOURNAL ARTICLE
Even initial feedback vertex set problem is NP-complete
Dan A. SimoviciGheorghe Grigoraş
Journal: Information Processing Letters Year: 1979 Vol: 8 (2)Pages: 64-66
BOOK-CHAPTER
Reachability Is NP-Complete Even for the Simplest Neural Networks
arXiv (Cornell University) Year: 2021