Call Number | SEM-202 |
Collection Type | Indeks Artikel prosiding/Sem |
Title | Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy(extended abstract),Hal 449-458 |
Author | Hans L.Bodlaender; |
Publisher | Proceedings of the twenty-sixth annual ACM symposium on the theory of computing Montreal,Quebec,Canada May 23-25,1994 |
Subject | |
Location |
Nomor Panggil | ID Koleksi | Status |
---|---|---|
SEM-202 | TERSEDIA |