Recognising a partitionable simplicial complex is in NP
Author/Authors :
S.D. Noble، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Pages :
3
From page :
303
To page :
305
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 by Kleinschmidt and Onn (1995).
