Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1675
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noble, SD | - |
dc.coverage.spatial | 3 | en |
dc.date.accessioned | 2008-02-20T11:54:42Z | - |
dc.date.available | 2008-02-20T11:54:42Z | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | Discrete Mathematics 152(1-3): 303-305, May 1996 | en |
dc.identifier.issn | 0012-365X | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1675 | - |
dc.description.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 [1] | en |
dc.format.extent | 85218 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | en |
dc.title | Recognising a partitionable simplicial complex is in NP | en |
dc.type | Preprint | en |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(95)00248-U | - |
Appears in Collections: | Computer Science Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
complex.pdf | 83.22 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.