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)
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractWe show that the problem of recognising a partitionable simplicial complex is a member of th...
We show that the problem of recognising a partitionable simplicial complex is a member of the comple...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
We demonstrate the complexity class NL is equal to NP. In this way, we show that P is equal to NP, b...
This paper deals with complexity classes PC and NP C , as they were introduced over the complex numb...
International audienceWe say that a simplicial complex is shrinkable if there exists a sequence of a...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractWe show that the problem of recognising a partitionable simplicial complex is a member of th...
We show that the problem of recognising a partitionable simplicial complex is a member of the comple...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
We demonstrate the complexity class NL is equal to NP. In this way, we show that P is equal to NP, b...
This paper deals with complexity classes PC and NP C , as they were introduced over the complex numb...
International audienceWe say that a simplicial complex is shrinkable if there exists a sequence of a...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
DOI
Add to ORKG