Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/1675
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNoble, SD-
dc.coverage.spatial3en
dc.date.accessioned2008-02-20T11:54:42Z-
dc.date.available2008-02-20T11:54:42Z-
dc.date.issued1996-
dc.identifier.citationDiscrete Mathematics 152(1-3): 303-305, May 1996en
dc.identifier.issn0012-365X-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/1675-
dc.description.abstractWe show that the problem of recognising a partitionable simplicial complex is a member of the complexity class NP, thus answering a question raised in [1]en
dc.format.extent85218 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevieren
dc.titleRecognising a partitionable simplicial complex is in NPen
dc.typePreprinten
dc.identifier.doihttp://dx.doi.org/10.1016/0012-365X(95)00248-U-
Appears in Collections:Computer Science
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
complex.pdf83.22 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.