Please use this identifier to cite or link to this item:
|Title:||Recognising a partitionable simplicial complex is in NP|
|Citation:||Discrete Mathematics 152(1-3): 303-305, May 1996|
|Abstract:||We show that the problem of recognising a partitionable simplicial complex is a member of the complexity class NP, thus answering a question raised in |
|Appears in Collections:||Computer Science|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.