On the algebraic structure of combinatorial problems
type: Item
instance of: scholarly article
title: On the algebraic structure of combinatorial problems
zbMATH Open document ID: 0915.68074
DOI: 10.1016/S0304-3975(97)00230-2
published in: Theoretical Computer Science
publication date: 1999-01-20T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1243216
zbMATH Keywords: satisfiability
zbMATH Keywords: graph colorability
zbMATH Keywords: graph isomorphism
author: P. Jeavons
MaRDI profile type: Publication
cites work: On the complexity of colouring by superdigraphs of bipartite graphs
cites work: Q5515373
cites work: Characterising tractable constraints
cites work: Q4198056
cites work: Closed systems of functions and predicates
cites work: On the parallel complexity of discrete relaxation in constraint satisfaction networks
cites work: Fast parallel constraint satisfaction
cites work: On binary constraint problems
cites work: Q3751631
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q3221403
cites work: Q3739182
cites work: The complexity of satisfiability problems
cites work: Q3739181
description: scientific article; zbMATH DE number 1243216