Recognising a partitionable simplicial complex is in NP

Noble, Steven (1996) Recognising a partitionable simplicial complex is in NP. Discrete Mathematics 152 (1-3), pp. 303-305. ISSN 0012-365X.

Full text not available from this repository.

Official URL: https://doi.org/10.1016/0012-365X(95)00248-U

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).

Metadata

Item Type:	Article
School:	School of Business, Economics & Informatics > Economics, Mathematics and Statistics
Depositing User:	Sarah Hall
Date Deposited:	20 Jul 2020 15:23
Last Modified:	20 Jul 2020 15:23
URI:	https://eprints.bbk.ac.uk/id/eprint/32610

Statistics

Archive Staff Only (login required)

Edit/View Item