Complexity of satisfiability problems with symmetric polynomial clauses
type: Item
instance of: scholarly article
title: Complexity of satisfiability problems with symmetric polynomial clauses
zbMATH Open document ID: 0879.68054
author: Nadia Creignou
author: Malika More
publication date: 1998-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1036291
zbMATH Keywords: CNF-satisfiability
zbMATH Keywords: NP-complete problems
zbMATH Keywords: problem SAT
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1093/logcom/7.3.353
OpenAlex ID: W2076477022
DOI: 10.1093/LOGCOM/7.3.353
published in: Journal Of Logic And Computation
description: scientific article; zbMATH DE number 1036291